The Pentagon as a Substructure Lattice of Models of Peano Arithmetic
James H. Schmerl

TL;DR
This paper explores the structure of models of Peano Arithmetic, showing how the pentagon lattice can be realized as a substructure lattice in certain extensions, and clarifies conditions under which these extensions are end or cofinal.
Contribution
It proves that if the lattice of an extension is a pentagon, then the extension is either an end or cofinal extension, but also provides counterexamples in nonstandard models.
Findings
Pentagon lattice can be realized as a substructure lattice of models of PA.
Extensions with pentagon lattice are either end or cofinal extensions.
Counterexamples exist where the lattice is pentagon but the extension is neither end nor cofinal.
Abstract
Wilke proved in 1977 that every countable model of Peano Arithmetic has an elementary end extension such that the interstructure lattice Lt() is the pentagon lattice . This theorem implies that every countable nonstandard has an elementary cofinal extension such that Lt(. It is proved here that if and Lt(, then is either an end or a cofinal extension of . In contrast, there are such that Lt( and is neither an end nor a cofinal extension of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
