Gödelisation of Peano Arithmetic

Lorenz Halbeisen and Regula Krapf
Additional contact information
Lorenz Halbeisen: ETH Zurich, Department of Mathematics
Regula Krapf: Universität Bonn, Mathematics Institute

Chapter Chapter 9 in Gödel's Theorems and Zermelo's Axioms, 2025, pp 103-123 from Springer

Abstract: Abstract The key ingredient for Gödel’s Incompleteness Theorems is the so-called Gödelisation process which allows us to code terms, formulae and even proofs within PA.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-85106-3_10

Ordering information: This item can be ordered from
http://www.springer.com/9783031851063

DOI: 10.1007/978-3-031-85106-3_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().