Tableaus for many-valued modal logic
Studia Logica 55 (1):63 - 87 (1995)
| Abstract | We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cut-free tableau formulation is presented, and its completeness is proved. | |||||||||
| 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,679 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesMauro Ferrari (1997). Cut-Free Tableau Calculi for Some Intuitionistic Modal Logics. Studia Logica 59 (3):303-330.
Josep Maria Font & Petr Hájek (2002). On Łukasiewicz's Four-Valued Modal Logic. Studia Logica 70 (2):157-182.
Xavier Caicedo & Ricardo O. Rodriguez (2010). Standard Gödel Modal Logics. Studia Logica 94 (2).
Walter Sinnott-Armstrong & Amit Malhotra (2002). How to Avoid Deviance (in Logic). History and Philosophy of Logic 23 (3):215--36.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads5 ( #160,368 of 549,088 )Recent downloads (6 months)2 ( #37,333 of 549,088 )How can I increase my downloads? |
My notes
Discussion
