Justification logics are logics of knowledge in which explicit reasons are formally represented. Standard logics of knowledge have justification logic analogs. Connecting justification logics and logics of knowledge are Realization Theorems. In this paper we give a new, constructive proof of the Realization Theorem connecting S5 and its justification analog, JS5. This proof is, I believe, the simplest in the literature.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Realization for Justification Logics Via Nested Sequents: Modularity Through Embedding.Remo Goetschi & Roman Kuznets - 2012 - Annals of Pure and Applied Logic 163 (9):1271-1298.
Similar books and articles
The Simple Substitution Property of Gödel's Intermediate Propositional Logics Sn's.Katsumi Sasaki - 1990 - Studia Logica 49 (4):471 - 481.
Gleason's Theorem has a Constructive Proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
A Constructive Proof of McNaughton's Theorem in Infinite-Valued Logic.Daniele Mundici - 1994 - Journal of Symbolic Logic 59 (2):596-602.
Counting the Maximal Intermediate Constructive Logics.Mauro Ferrari & Pierangelo Miglioli - 1993 - Journal of Symbolic Logic 58 (4):1365-1401.
Added to index2009-06-23
Total downloads27 ( #191,558 of 2,178,148 )
Recent downloads (6 months)1 ( #316,504 of 2,178,148 )
How can I increase my downloads?