Sequent logic of arithmetic decidability

MaRDI QIDQ1866903zbMATH OpenFDO

Authors Evgeni E. Zolin

Publication date 23 April 2003

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

arithmetic solvabilityGödel-Löb logicprovability logicsequent logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Review text

This paper follows the works by \textit{H. Montgomery} and \textit{R. Routley} [Logique Anal. 11, 422-424 (1968; Zbl 0169.30003)] and \textit{I. L. Humberstone} [Notre Dame J. Formal Logic 36, 214-229 (1995; Zbl 0833.03004)]. The author proposes an axiomatics for the provability logic over GL, i.e. the logic which is complete in the interpretation of formulas of the form \(\vartriangleright A\) such as ``the assertion \(A\) is provable in Peano arithmetic. Also sequent calculi are presented for the provability logics over K, K4 and GL.

Recommendations

• A proof theory for the logic of provability in true arithmetic
• Provability and modal logic
• scientific article; zbMATH DE number 517064
• Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases
• Modal logics with several operators and probability interpretations

Cited in

(8)

• \(k\)-provability in \(\mathrm{PA}\)
• Symmetric contingency logic with unlimitedly many modalities
• Completeness and Decidability in Sequence Logic
• Decidability and Specker sequences in intuitionistic mathematics
• scientific article; zbMATH DE number 1916517 (Why is no real title available?)
• How much propositional logic suffices for Rosser's essential undecidability theorem?
• Nested sequent calculi for some modal logics with non-standard modalities
• Sequential operators in computability logic

This page was built for publication: Sequent logic of arithmetic decidability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1866903)