Interpretability suprema in Peano arithmetic
A theory $S$ interprets a theory $T$ if there is a translation of the language $T$ into the language of $S$ mapping theorems to theorems. If $T$ is a sufficiently strong theory one can consider the relation of relative interpretability: $T+\varphi$ interprets $T+\psi$ where $\varphi$ and $\psi$ are formulas. Mutual interpretability is an equivalence relation. Equivalence classes are called degrees of interpretability, and they are denoted by $[\varphi]$. \par The structure of the degrees of interpretabiltiy of r.e. theories extending PA is distributive lattice [\textit{V. Švejdar}, Commentat. Math. Univ. Carol. 19, 789--813 (1978; Zbl 0407.03020)]. The degree $[\varphi\vee \psi]$ is the infimum of $[\varphi]$ and $[\psi].$ The construction of the supremum of $[\varphi]$ and $[\psi]$ is somewhat more complicated. The provability logic is a simple modal description of the provability predicate. \par Interpretability logic is an extension of provability logic suitable for a modal study of relative interpretability [\textit{A. Visser}, CSLI Lect. Notes 87, 307--359 (1998; Zbl 0915.03020)]. \textit{A. Berarducci} [J. Symb. Log. 55, No. 3, 1059--1089 (1990; Zbl 0725.03037)] and \textit{V. Shavrukov} [The logic of relative interpretability over Peano arithmetic. Techn. Rep. No. 5. Moscow: Steklov Mathematical Institute (1988)] proved (independently) that the interpretability logic \textbf{IL}M is complete for arithmetical interpretations in essentially reflexive theories -- such as PA. \par The notion of the infimum of degrees of interpretability can be handled in \textbf{IL}M, but the supremum may not. In the paper under review, it is shown how the system \textbf{IL}M can be augmented with a new modality as a supremum operator. The authors explore different options for specifying the exact meaning of the new modality.
- A new principle in the interpretability logic of all reasonable arithmetical theories
- scientific article; zbMATH DE number 218496
- scientific article; zbMATH DE number 1215477
- A note on the interpretability logic of finitely axiomatized theories
- TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
- Interpolation and the interpretability logic of PA
- Provability and interpretability logics with restricted realizations
- On the proofs of arithmetical completeness for interpretability logic
- The interpretability logic of all reasonable arithmetical theories. The new conjecture
- Interpretability in PRA
- A smart child of Peano's
- An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
- Arithmetic analogues of McAloon's unique Rosser sentences
- Arithmetization of metamathematics in a general setting
- Consistency statements in formal theories
- Existence and feasibility in arithmetic
- scientific article; zbMATH DE number 3632437 (Why is no real title available?)
- scientific article; zbMATH DE number 1215477 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 218496 (Why is no real title available?)
- scientific article; zbMATH DE number 3365265 (Why is no real title available?)
- On certain lattices of degrees of interpretability
- On interpretability in theories containing arithmetic
- On the algebraization of a Feferman's predicate. (The algebraization of theories which express Theor; X)
- On the proof of Solovay's theorem
- Partially Conservative Extensions of Arithmetic
- Peano's smart children: A provability logical study of systems with built-in consistency
- Provability interpretations of modal logic
- Reflection Principles in Fragments of Peano Arithmetic
- Relative Interpretations
- Representability op recursively enumerable sets in formal theories
- Solution of a problem of Leon Henkin
- The interpretability logic of Peano arithmetic
- Theories incomparable with respect to relative interpretability
- Undecidable theories
- Interpretability in PRA
- Interpretability of various extensions of arithmetic
- Interpretations of Presburger arithmetic in itself
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
- scientific article; zbMATH DE number 2014521 (Why is no real title available?)
- The interpretability logic of Peano arithmetic
- scientific article; zbMATH DE number 2236629 (Why is no real title available?)
- Reflexivity of -consistency in a general setting
- Numeral completeness of weak theories of arithmetic
- General notions of consistency
- On certain lattices of degrees of interpretability
This page was built for publication: Interpretability suprema in Peano arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402961)
