Searcharxiv⌕ Search

arXiv · 2611.16067

Rigid Theories

Abstract

A structure is rigid if it admits no non-trivial automorphisms. We investigate an analogous invariance property for first-order theories, with relative interpretations playing the role of morphisms. A theory $T$ is called rigid if and only if every self-interpretation of $T$ is definably isomorphic to the identity interpretation. Extending work of Pakhomov and Zapryagaev (2020) on Presburger Arithmetic, we establish rigidity for Successor Arithmetic and Skolem Arithmetic (with respect to one-dimensional interpretations), True Arithmetic, and the theories of fields $\mathrm{RCF}$ and $\mathrm{ACF}$. By contrast, $\mathrm{PA}$ and $\mathrm{ZF}$ admit infinitely many self-interpretations, though both remain rigid with respect to (co-)retractions. Our main negative result is that $\mathrm{ZFC}$ has no consistent rigid extension in its own language. We compare rigidity with categoricity, model rigidity, completeness, and solidity, showing it to be independent of the first three, and indicate the relevance of rigidity to questions about semantic determinacy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mirko Engler, Benjamin Zayton. 2026-11-11. Rigid Theories. https://searcharxiv.com/abs/2611.16067

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗