The arithmetics of a theory (Q2345393): Difference between revisions

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)].