The arithmetics of a theory
The interpretations of a weak arithmetic, like Buss's theory \(\mathrm{S}_2^1\) or \(\mathrm{I}\Delta_0+\Omega_1,\) in a given theory \(U\) are studied. The author calls these interpretations the arithmetics of \(U\). The definable initial embedding ordering is a natural ordering of the arithmetics of \(U.\) The basics of the structure of the arithmetics of \(U\) is developed. The provability logics of a theory \(U\) from the standpoint of the framework of the arithmetics of \(U\) are considered. The propositional modal principles for provability that hold in all arithmetics in any theory \(U\) are fully characterized. Solovay's theorem is studied in various settings. The author presents a proof of Solovay's completeness theorem for Löb logic via a version of the proof given by \textit{D. de Jongh} et al. [Stud. Log. 50, No. 1, 51--69 (1991; Zbl 0744.03057)]. At the end, the author provides a deeper study of the arithmetics of a finitely axiomatized sequential theory. Results due to \textit{J. Krajíček} [Arch. Math. Logik Grundlagenforsch. 26, 169--176 (1987; Zbl 0633.03056)] are strengthened. The paper under review is a remake of the paper [the author, Notre Dame J. Formal Logic 32, No. 4, 554--561 (1991; Zbl 0747.03026)].
- A lattice of chapters of mathematics (interpretations between theorems [theories])
- A note on proofs of falsehood
- An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
- Arithmetization of metamathematics in a general setting
- Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases
- Can we make the second incompleteness theorem coordinate free?
- CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
- Computer Science Logic
- Cut Elimination In Situ
- Cuts, consistency statements and interpretations
- Faith \& falsity
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1215499 (Why is no real title available?)
- scientific article; zbMATH DE number 1170091 (Why is no real title available?)
- scientific article; zbMATH DE number 218514 (Why is no real title available?)
- On parameter free induction schemas
- On the \(\Sigma{}^ 0_ 1\)-conservativity of \(\Sigma{}^ 0_ 1\)- completeness
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
- On the proof of Solovay's theorem
- On the scheme of induction for bounded arithmetic formulas
- Peano Corto and Peano Basso: a study of local induction in the context of weak theories
- Provability logic—a short introduction
- Provability: The emergence of a mathematical modality
- Rosser sentences
- Self-reference and modal logic
- Some Prime Elements in the Lattice of Interpretability Types
- The formalization of interpretability
- The role of quantifier alternations in cut elimination
- The unprovability of small inconsistency. A study of local and global interpretability
- Friedman-reflexivity
- Uniform density in Lindenbaum algebras
- An interpretation of \(S_2^1\) in \(\Sigma_1^b\)-NIA
- Sequence encoding without induction
- scientific article; zbMATH DE number 3884151 (Why is no real title available?)
- TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
- The small-is-very-small principle
- scientific article; zbMATH DE number 5255443 (Why is no real title available?)
This page was built for publication: The arithmetics of a theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345393)
