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 (categorize this paper)
DOI 10.1007/BF01053032
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,440
Through your library
References found in this work BETA
The Mathematics of Metamathematics.Helena Rasiowa - 1963 - Warszawa, Państwowe Wydawn. Naukowe.
First-Order Logic.Raymond M. Smullyan - 1968 - New York [Etc.]Springer-Verlag.
Proof Methods for Modal and Intuitionistic Logics.Melvin Fitting - 1985 - Journal of Symbolic Logic 50 (3):855-856.

View all 8 references / Add more references

Citations of this work BETA
Many-Valued Modal Logics: A Simple Approach.Graham Priest - 2008 - Review of Symbolic Logic 1 (2):190-203.
How True It is = Who Says It's True.Melvin Fitting - 2009 - Studia Logica 91 (3):335 - 366.
How True It Is = Who Says It’s True.Melvin Fitting - 2009 - Studia Logica 91 (3):335-366.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
40 ( #131,634 of 2,180,418 )

Recent downloads (6 months)
4 ( #68,339 of 2,180,418 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums