Annals of Pure and Applied Logic 113 (1-3):345-372 (2001)

In the paper the joint Logic of Proofs and Provability is presented that incorporates both the modality □ for provability 287–304) and the proof operator tF representing the proof predicate “t is a proof of F” . The obtained system naturally includes both the modal logic of provability GL and Artemov's Logic of Proofs . The presence of the modality □ requires two new operations on proofs that together with operations of allow to realize all the invariant operations on proofs admitting description in the modal propositional language. Logic is proved to be decidable and complete with the intended provability semantics
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/s0168-0072(01)00066-5
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,979
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Explicit Provability and Constructive Semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Logic of Proofs.Sergei Artëmov - 1994 - Annals of Pure and Applied Logic 67 (1-3):29-59.

Add more references

Citations of this work BETA

Justification Logic.Sergei Artemov - forthcoming - Stanford Encyclopedia of Philosophy.
Tableaux and Hypersequents for Justification Logics.Hidenori Kurokawa - 2012 - Annals of Pure and Applied Logic 163 (7):831-853.
The Topology of Justification.Sergei Artemov & Elena Nogina - 2008 - Logic and Logical Philosophy 17 (1-2):59-71.

Add more citations

Similar books and articles

Explicit Provability and Constructive Semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
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.
On Logic of Proofs and Provability.Elena Nogina - 2006 - Bulletin of Symbolic Logic 12 (2):356.
A Modal Provability Logic of Explicit and Implicit Proofs.Evan Goris - 2010 - Annals of Pure and Applied Logic 161 (3):388-403.
Provability Logics with Quantifiers on Proofs.Rostislav E. Yavorsky - 2001 - Annals of Pure and Applied Logic 113 (1-3):373-387.
The Decision Problem of Provability Logic with Only One Atom.Vítězslav Švejdar - 2003 - Archive for Mathematical Logic 42 (8):763-768.
Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
Algebra of Proofs.M. E. Szabo - 1978 - Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.
Hypothetical Logic of Proofs.Eduardo Bonelli & Gabriela Steren - 2014 - Logica Universalis 8 (1):103-140.


Added to PP index

Total views
18 ( #607,806 of 2,504,875 )

Recent downloads (6 months)
5 ( #140,251 of 2,504,875 )

How can I increase my downloads?


My notes