Essential Incompleteness of Arithmetic Verified by Coq
<|reference_start|>Essential Incompleteness of Arithmetic Verified by Coq: A constructive proof of the Goedel-Rosser incompleteness theorem 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.<|reference_end|>
@article{o'connor2005essential,
    title={Essential Incompleteness of Arithmetic Verified by Coq},
    author={Russell O'Connor},
    journal={Russell O'Connor, Essential Incompleteness of Arithmetic Verified
  by Coq, Lecture Notes in Computer Science, Volume 3603, Aug 2005, Pages 245 -
  260},
    year={2005},
    doi={10.1007/11541868_16},
    archivePrefix={arXiv},
    eprint={cs/0505034},
    primaryClass={cs.LO}
}