Results 1  10
of
21
Provability logic
 Handbook of Philosophical Logic, 2nd ed
, 2004
"... We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t:F that read t is a justification for F. Justification Logic absorbs basic principles origin ..."
Abstract

Cited by 29 (9 self)
 Add to MetaCart
We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t:F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the wellknown Justified True Belief vs. Knowledge problem. As a case study, we formalize Gettier examples in Justification Logic and reveal hidden assumptions and redundancies in Gettier reasoning. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a robust system of justifications. This renders a new, evidencebased foundation for epistemic logic. 1
On Epistemic Logic with Justification
 NATIONAL UNIVERSITY OF SINGAPORE
, 2005
"... The true belief components of Plato's tripartite definition of knowledge as justified true belief are represented in formal epistemology by modal logic and its possible worlds semantics. At the same time, the justification component of Plato's definition did not have a formal representat ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
The true belief components of Plato's tripartite definition of knowledge as justified true belief are represented in formal epistemology by modal logic and its possible worlds semantics. At the same time, the justification component of Plato's definition did not have a formal representation. This
FirstOrder Logic of Proofs
, 2011
"... The propositional logic of proofs LP revealed an explicit provability reading of modal logic S4 which provided an indented provability semantics for the propositional intuitionistic logic IPC and led to a new area, Justification Logic. In this paper, we find the firstorder logic of proofs FOLP capa ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
The propositional logic of proofs LP revealed an explicit provability reading of modal logic S4 which provided an indented provability semantics for the propositional intuitionistic logic IPC and led to a new area, Justification Logic. In this paper, we find the firstorder logic of proofs FOLP capable of realizing firstorder modal logic S4 and, therefore, the firstorder intuitionistic logic HPC. FOLP enjoys a natural provability interpretation; this provides a semantics of explicit proofs for firstorder S4 and HPC compliant with BrouwerHeytingKolmogorov requirements. FOLP opens the door to a general theory of firstorder justification.
On the NoCounterexample Interpretation
 J. SYMBOLIC LOGIC
, 1997
"... In [15],[16] Kreisel introduced the nocounterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated "substitution method (due to W. Ackermann), that for every theorem A (A prenex) of firstorder Peano arithmetic PA one can find ordinal recursive f ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
In [15],[16] Kreisel introduced the nocounterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated "substitution method (due to W. Ackermann), that for every theorem A (A prenex) of firstorder Peano arithmetic PA one can find ordinal recursive functionals \Phi A of order type ! " 0 which realize the Herbrand normal form A of A. Subsequently more
Referential logic of proofs
 Theoretical Computer Science
"... We introduce an extension of the propositional logic of singleconclusion proofs by the second order variables denoting the reference constructors of the type “the formula which is proved by x. ” The resulting Logic of Proofs with References, FLPref, is shown to be decidable, and to enjoy soundness ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We introduce an extension of the propositional logic of singleconclusion proofs by the second order variables denoting the reference constructors of the type “the formula which is proved by x. ” The resulting Logic of Proofs with References, FLPref, is shown to be decidable, and to enjoy soundness and completeness with respect to the intended provability semantics. We show that FLPref provides a complete test of admissibility of inference rules in a sound extension of arithmetic. Key words: proof theory, explicit modal logic, single conclusion logic of proofs, proof term, reference, unification, admissible inference rule. 1
Unfolding finitist arithmetic
, 2010
"... The concept of the (full) unfolding U(S) of a schematic system S is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted S? The program to determine U(S) for various systems S of foundational significan ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The concept of the (full) unfolding U(S) of a schematic system S is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted S? The program to determine U(S) for various systems S of foundational significance was previously carried out for a system of nonfinitist arithmetic, NFA; it was shown that U(NFA) is prooftheoretically equivalent to predicative analysis. In the present paper we work out the unfolding notions for a basic schematic system of finitist arithmetic, FA, and for an extension of that by a form BR of the socalled Bar Rule. It is shown that U(FA) and U(FA + BR) are prooftheoretically equivalent, respectively, to Primitive Recursive Arithmetic, PRA, and to Peano Arithmetic, PA.
Unified Semantics for Modality and lambdaterms via Proof Polynomials
"... It is shown that the modal logic S4, simple calculus and modal calculus admit a realization in a very simple propositional logical system LP , which has an exact provability semantics. In LP both modality and terms become objects of the same nature, namely, proof polynomials. The provability inte ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
It is shown that the modal logic S4, simple calculus and modal calculus admit a realization in a very simple propositional logical system LP , which has an exact provability semantics. In LP both modality and terms become objects of the same nature, namely, proof polynomials. The provability interpretation of modal terms presented here may be regarded as a systemindependent generalization of the CurryHoward isomorphism of proofs and terms. 1 Introduction The Logic of Proofs (LP , see Section 2) is a system in the propositional language with an extra basic proposition t : F for "t is a proof of F ". LP is supplied with a formal provability semantics, completeness theorems and decidability algorithms ([3], [4], [5]). In this paper it is shown that LP naturally encompasses calculi corresponding to intuitionistic and modal logics, and combinatory logic. In addition, LP is strictly more expressive because it admits arbitrary combinations of ":" and propositional connectives. The id...
The Basic Intuitionistic Logic of Proofs
, 2005
"... The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found. 1 Introduction. The classical logic of p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found. 1 Introduction. The classical logic of proofs LP inspired by the works by Kolmogorov [24] and Gödel [16, 17] was found in [3, 4] (see also surveys [6, 8, 12]). LP is a natural extension of the classical propositional logic in a language of proofcarrying formulas. LP axiomatizes all valid logical principles concerning propositions and proofs with a fixed sufficiently
Operations on Proofs That Can Be Specified By Means of Modal Logic
"... Explicit modal logic was first sketched by Gödel in [16] as the logic with the atoms "t is a proof of F". The complete axiomatization of the Logic of Proofs LP was found in [4] (see also [6],[7],[18]). In this paper we establish a sort of a functional completeness property of proof polynom ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Explicit modal logic was first sketched by Gödel in [16] as the logic with the atoms "t is a proof of F". The complete axiomatization of the Logic of Proofs LP was found in [4] (see also [6],[7],[18]). In this paper we establish a sort of a functional completeness property of proof polynomials which constitute the system of proof terms in LP. Proof polynomials are built from variables and constants by three operations on proofs: "\Delta" (application), "!" (proof checker), and "+" (choice). Here constants stand for canonical proofs of "simple facts", namely instances of propositional axioms and axioms of LP in a given proof system. We show that every operation on proofs that (i) can be specified in a propositional modal language and (ii) is invariant with respect to the choice of a proof system is realized by a proof polynomial.