Results 1 
3 of
3
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 representation. This ..."
Abstract

Cited by 20 (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
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
Basic systems of epistemic logic with justification
, 2005
"... An issue of an epistemic logic with justification has been discussed since the early 1990s. Such a logic, along with the usual knowledge operator ✷F (F is known), should contain assertions t:F (t is a justification for F), which gives a more nuanced and realistic model of knowledge. In this paper, w ..."
Abstract
 Add to MetaCart
An issue of an epistemic logic with justification has been discussed since the early 1990s. Such a logic, along with the usual knowledge operator ✷F (F is known), should contain assertions t:F (t is a justification for F), which gives a more nuanced and realistic model of knowledge. In this paper, we build two systems of epistemic logic with justification: the minimal one—S4LP—which is an extension of the basic epistemic logic S4 by an appropriate calculus of justification corresponding to the logic of proofs LP, and S4LPN—which is S4LP augmented by the explicit negative introspection principle ¬(t:F) → ✷¬(t:F). Epistemic semantics for both systems are suggested. Completeness and specific properties of S4LP and S4LPN, reflecting the explicit character of those systems, are established. 1