Tightness and solidity in fragments of Peano Arithmetic
Piotr Gruza, Leszek Aleksander Ko{\l}odziejczyk, Mateusz {\L}e{\l}yk

TL;DR
This paper investigates the properties of tightness, neatness, and solidity in fragments of Peano Arithmetic, establishing the existence of intermediate theories with specific properties and exploring their interpretability and relationships.
Contribution
It proves the existence of proper solid and tight but not neat theories between fragments of Peano Arithmetic, and examines their interpretability and related properties.
Findings
Existence of solid theories between IΣₙ and PA.
Existence of tight but not neat theories between IΣₙ and PA.
Solid subtheories of PA can be non-interpreting PA.
Abstract
It was shown by Visser that Peano Arithmetic has the property that any two bi-interpretable extensions of it (in the same language) are equivalent. Enayat proposed to refer to this property of a theory as tightness and to carry out a more systematic study of tightness and its stronger variants that he called neatness and solidity. Enayat proved that not only , but also and are solid. On the other hand, it was shown in later work by a number of authors that many natural proper fragments of those theories are not even tight. Enayat asked whether there is a proper solid subtheory of the theories listed above. We answer that question in the case of by proving that for every , there exist both a solid theory and a tight but not neat theory strictly between and . Moreover, the solid subtheories 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
TopicsComputability, Logic, AI Algorithms · Logic, programming, and type systems · Advanced Topology and Set Theory
