Essential incompleteness of arithmetic verified by coq
In: TPHOLs 2005 : theorem proving in higher order logics (Oxford, 22-25 August 2005)Lecture notes in computer science :245-260
Konferenz
- print, 14 ref
Zugriff:
A constructive proof of the Gödel-Rosser incompleteness the[. orem [9] has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive functions is given, and all primitive recursive functions are proved to be representable in a weak axiom system. Formulas and proofs are encoded as natural numbers, and functions operating on these codes are proved to be primitive recursive. The weak ' axiom system is proved to be essentially incomplete. In particular, Peano arithmetic is proved to be consistent in Coq's type theory and therefore is incomplete.
Titel: |
Essential incompleteness of arithmetic verified by coq
|
---|---|
Autor/in / Beteiligte Person: | O'CONNOR, Russell |
Link: | |
Quelle: | TPHOLs 2005 : theorem proving in higher order logics (Oxford, 22-25 August 2005)Lecture notes in computer science :245-260 |
Veröffentlichung: | Berlin: Springer, 2005 |
Medientyp: | Konferenz |
Umfang: | print, 14 ref |
ISSN: | 0302-9743 (print) |
Schlagwort: |
|
Sonstiges: |
|