Peano Arithmetic and Recursive Functions

Serafim Batzoglou
Additional contact information
Serafim Batzoglou: Seer Inc.

Chapter Chapter 2 in Introduction to Incompleteness, 2024, pp 15-34 from Springer

Abstract: Abstract Gödel’s incompleteness theorems apply to any axiomatic system that is powerful enough, a notion that will become precise in this chapter. Peano Arithmetic (PA) is a natural choice of an axiomatic system to discuss the theorems and will serve as our model axiomatic system for Chaps. 3 , 6 , 7 , 8 , and 10 .

Date: 2024
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-64217-3_2

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

DOI: 10.1007/978-3-031-64217-3_2

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 ().