Sequent logic of arithmetic decidability (Q1866903)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1900011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequent logic of arithmetic decidability |
scientific article; zbMATH DE number 1900011 |
Statements
Sequent logic of arithmetic decidability (English)
0 references
23 April 2003
0 references
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.
0 references
arithmetic solvability
0 references
sequent logic
0 references
Gödel-Löb logic
0 references
provability logic
0 references
0.8201119899749756
0 references
0.8098281621932983
0 references
0.7887609601020813
0 references
0.7787525057792664
0 references
