SearcharxivSearch

arXiv · 2512.09120

Tightness and solidity in fragments of Peano Arithmetic

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 \emph{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 $\mathsf{PA}$, but also $\mathsf{ZF}$ and $\mathsf{Z}_2$ 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 $\mathsf{PA}$ by proving that for every $n$, there exist both a solid theory and a tight but not neat theory strictly between $\mathsf{I}\Sigma_n$ and $\mathsf{PA}$. Moreover, the solid subtheories of $\mathsf{PA}$ can be required to be unable to interpret $\mathsf{PA}$. We also provide simple examples of proper solid subtheories of $\mathsf{ZF}$ and $\mathsf{Z}_2$, as well as further separations between properties related to tightness, including an example of a sequential theory that is neat but not semantically tight in the sense of Freire and Hamkins.

Explore related subjects

Keep this discovery

BibTeXRIS

Piotr Gruza, Leszek Aleksander Kołodziejczyk, Mateusz Łełyk. 2025-12-09. Tightness and solidity in fragments of Peano Arithmetic. https://arxiv.org/abs/2512.09120

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO