| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Recursion Theorem in ZF
| Title: | Recursion Theorem in ZF |
| Author: | Georgy Dunaev (georgedunaev /at/ gmail /dot/ com) |
| Submission date: | 2020-05-11 |
| Abstract: | This document contains a proof of the recursion theorem. This is a mechanization of the proof of the recursion theorem from the text Introduction to Set Theory, by Karel Hrbacek and Thomas Jech. This implementation may be used as the basis for a model of Peano arithmetic in ZF. While recursion and the natural numbers are already available in Isabelle/ZF, this clean development is much easier to follow. |
| BibTeX: |
@article{Recursion-Addition-AFP,
author = {Georgy Dunaev},
title = {Recursion Theorem in ZF},
journal = {Archive of Formal Proofs},
month = may,
year = 2020,
note = {\url{http://isa-afp.org/entries/Recursion-Addition.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |