论文信息 - The Basic Logic of Proofs

The Basic Logic of Proofs

Propositional Provability Logic was axiomatized in [5]. This logic describes the behaviour of the arithmetical operator “y is provable”. The aim of the current paper is to provide propositional axiomatizations of the predicate “x is a proof of y”by means of modal logic, with the intention of meeting some of the needs of computer science.

Sergei N. Artëmov | Tyko Straßen | Tyko Straßen

[1] George Boolos,et al. Extremely undecidable sentences , 1982, Journal of Symbolic Logic.

[2] H. Keisler,et al. Handbook of mathematical logic , 1977 .

[3] G. Boolos. The Unprovability of Consistency: An Essay in Modal Logic , 1979 .

[4] George Boolos,et al. Review: Robert M. Solovay, Provability Interpretations of Modal Logic , 1981 .

[5] Sergei N. Artëmov,et al. Functionality in the Basic Logic of Proofs , 1993 .

[6] C. Smorynski. The Incompleteness Theorems , 1977 .

[7] R. Solovay. Provability interpretations of modal logic , 1976 .