Consistency of PA and ε 0 $$\varepsilon _0$$ Induction

Serafim Batzoglou
Additional contact information
Serafim Batzoglou: Seer Inc.

Chapter Chapter 10 in Introduction to Incompleteness, 2024, pp 179-216 from Springer

Abstract: Abstract In the 1930s, Gentzen presented several versions of a proof of the consistency of PA from a weaker system, primitive recursive arithmetic (PRA), augmented with the additional principle of transfinite induction up to the ordinal ε 0 $$\varepsilon _0$$

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_10

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

DOI: 10.1007/978-3-031-64217-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 ().