### Abstract

This document presents the formalization of introductory material from recursion theory --- definitions and basic properties of primitive recursive functions, Cantor pairing function and computably enumerable sets (including a proof of existence of a one-complete computably enumerable set and a proof of the Rice's theorem).

### License

BSD License

### Topics

- Logic/Computability

### Session Recursion-Theory-I

- CPair
- PRecFun
- PRecList
- PRecFun2
- PRecFinSet
- PRecUnGr
- RecEnSet

### Used by

- Minsky Machines

## Cite

×

Recursion-Theory-I-AFP

    @article{Recursion-Theory-I-AFP,
      author  = {Michael Nedzelsky},
      title   = {Recursion Theory I},
      journal = {Archive of Formal Proofs},
      month   = {April},
      year    = {2008},
      note    = {\url{https://isa-afp.org/entries/Recursion-Theory-I.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Aug 28, 2014 : Isabelle2014
- Dec 11, 2013 : Isabelle2013-2
- Nov 17, 2013 : Isabelle2013-1
- Feb 16, 2013 : Isabelle2013
- May 24, 2012 : Isabelle2012
- Oct 11, 2011 : Isabelle2011-1
- Feb 11, 2011 : Isabelle2011
- Jul 1, 2010 : Isabelle2009-2
- Dec 12, 2009 : Isabelle2009-1
- Apr 29, 2009 : Isabelle2009
- Jun 10, 2008 : Isabelle2008
- Apr 11, 2008 : Isabelle2007