The realization theorem for s5 a simple, constructive proof
| Abstract | 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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesKatsumi Sasaki (1990). The Simple Substitution Property of Gödel's Intermediate Propositional Logics Sn's. Studia Logica 49 (4):471 - 481.
Luca Viganò (2000). Labelled Non-Classical Logics. Kluwer Academic Publishers.
Fred Richman (2000). Gleason's Theorem has a Constructive Proof. Journal of Philosophical Logic 29 (4):425-431.
Daniele Mundici (1994). A Constructive Proof of McNaughton's Theorem in Infinite-Valued Logic. Journal of Symbolic Logic 59 (2):596-602.
Mauro Ferrari & Pierangelo Miglioli (1993). Counting the Maximal Intermediate Constructive Logics. Journal of Symbolic Logic 58 (4):1365-1401.
Analytics
Monthly downloads |
Added to index2009-06-23Total downloads8 ( #122,991 of 549,034 )Recent downloads (6 months)1 ( #63,261 of 549,034 )How can I increase my downloads? |
My notes
Discussion
