A quantified logic of evidence

Annals of Pure and Applied Logic 152 (1):67-83 (2008)
Abstract
A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several papers along these lines. A major result about LP is the Realization Theorem, that says any theorem of S4 can be converted into a theorem of LP by some replacement of necessitation symbols with explicit proof terms. Thus the necessitation operator of S4 can be seen as a kind of implicit existential quantifier: there exists a proof term such that…. In this paper, quantification over evidence is introduced into LP, and it is shown that the connection between S4 necessitation and the existential quantifier becomes an explicit one. The extension of LP with quantifiers is called QLP. A semantics and an axiom system for QLP are given, soundness and completeness are established, and several results are proved relating QLP to LP and to S4
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2007.11.003
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,195
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.
The Logic of Proofs, Semantically.Melvin Fitting - 2005 - Annals of Pure and Applied Logic 132 (1):1-25.
Provability Logics with Quantifiers on Proofs.Rostislav E. Yavorsky - 2001 - Annals of Pure and Applied Logic 113 (1-3):373-387.

Add more references

Citations of this work BETA
The Paradox of the Knower Revisited.Walter Dean & Hidenori Kurokawa - 2014 - Annals of Pure and Applied Logic 165 (1):199-224.

Add more citations

Similar books and articles
A Unified Completeness Theorem for Quantified Modal Logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
'Now' and 'Then' in Tense Logic.Ulrich Meyer - 2009 - Journal of Philosophical Logic 38 (2):229-247.
Non-Deductive Logic in Mathematics.James Franklin - 1987 - British Journal for the Philosophy of Science 38 (1):1-18.
The Logic of Proofs, Semantically.Melvin Fitting - 2005 - Annals of Pure and Applied Logic 132 (1):1-25.

Monthly downloads

Added to index

2009-06-23

Total downloads

34 ( #150,294 of 2,163,971 )

Recent downloads (6 months)

2 ( #188,913 of 2,163,971 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums