A well-known problem with Hintikka-style logics of knowledge is that of logical omniscience. One knows too much. This breaks down into two subproblems: one knows all tautologies, and one’s knowledge is closed under consequence. A way of addressing the second of these is to move from knowledge simpliciter, to knowledge for a reason. Then, as consequences become ‘further away’ from one’s basic knowledge, reasons for them become more complex, thus providing a kind of resource measurement. One kind of reason is a formal proof. Sergei Artemov has introduced a logic of explicit proofs, LP. I present a semantics for this, based on the idea that it is a logic of knowledge with explicit reasons. A number of fundamental facts about LP can be established using this semantics. But it is equally important to realize that it provides a natural logic of more general applicability than its original provenance, arithmetic provability.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
The Logic of Justified Belief, Explicit Knowledge, and Conclusive Evidence.Alexandru Baltag, Bryan Renne & Sonja Smets - 2014 - Annals of Pure and Applied Logic 165 (1):49-81.
Non-Circular Proofs and Proof Realization in Modal Logic.Ren-June Wang - 2014 - Annals of Pure and Applied Logic 165 (7-8):1318-1338.
Similar books and articles
Explicit Provability and Constructive Semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Explicit Knowledge in Dolphins?Eduardo Mercado & Scott O. Murray - 1999 - Behavioral and Brain Sciences 22 (5):774-775.
A Quantified Logic of Evidence.Melvin Fitting - 2008 - Annals of Pure and Applied Logic 152 (1):67-83.
The Logic of Proofs, Semantically.Melvin Fitting - 2005 - Annals of Pure and Applied Logic 132 (1):1-25.
Added to index2009-06-23
Total downloads43 ( #122,176 of 2,177,930 )
Recent downloads (6 months)1 ( #317,203 of 2,177,930 )
How can I increase my downloads?