Provability logic in the Gentzen formulation of arithmetic

Mathematical Logic Quarterly 38 (1):535-550 (1992)
  Copy   BIBTEX

Abstract

In this paper are studied the properties of the proofs in PRA of provability logic sentences, i.e. of formulas which are Boolean combinations of formulas of the form PIPRA, where h is the Gödel-number of a sentence in PRA. The main result is a Normal Form Theorem on the proof-trees of provability logic sequents, which states that it is possible to split the proof into an arithmetical part, which contains only atomic formulas and has an essentially intuitionistic character, and into a logical part, which is merely instrumental. Moreover, the induction rules which occur in the arithmetical part are implicit. Some applications of the Normal Form Theorem are shown in order to obtain some syntactical results on the PRA-completeness of modal logic. In particular a completeness theorem for Boolean combinations of modalities is given

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,400

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Closed fragments of provability logics of constructive theories.Albert Visser - 2008 - Journal of Symbolic Logic 73 (3):1081-1096.
The Unprovability of Consistency: An Essay in Modal Logic.George Boolos - 1979 - Cambridge, England: Cambridge University Press.
Realization of Intuitionistic Logic by Proof Polynomials.Sergei N. Artemov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):285-301.
On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
A proof–theoretic study of the correspondence of hybrid logic and classical logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.

Analytics

Added to PP
2013-12-01

Downloads
15 (#700,732)

6 months
1 (#452,962)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Proof Theory.Gaisi Takeuti - 1975 - Mineola, New York: Elsevier.
The Unprovability of Consistency: An Essay in Modal Logic.George Boolos - 1979 - Cambridge, England: Cambridge University Press.
Self-Reference and Modal Logic.George Boolos & C. Smorynski - 1988 - Journal of Symbolic Logic 53 (1):306.
Proof Theory and Logical Complexity. [REVIEW]Helmut Pfeifer - 1991 - Annals of Pure and Applied Logic 53 (4):197.

View all 6 references / Add more references