Modal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity

Modal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by P. Mateus , A. Sernadas , C. Sernadas , L. Vigano

Venue:	LOGIC JOURNAL OF THE IGPL
Citations:	5 - 4 self

BibTeX

@ARTICLE{Mateus03modalsequent,
    author = {P. Mateus and A. Sernadas and C. Sernadas and L. Vigano},
    title = {Modal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity},
    journal = {LOGIC JOURNAL OF THE IGPL},
    year = {2003},
    volume = {13},
    pages = {173--199}
}

Bookmark

OpenURL

Abstract

Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as labels. The rules for formula constructors are common to all modal systems. For each modal system, specific rules for truth values are provided that reflect the envisaged properties of the accessibility relation. Both local and global reasoning are supported. Strong completeness is proved for a natural two-sorted algebraic semantics. As a corollary, strong completeness is also obtained over general Kripke semantics. A duality result

Citations

493	Untersuchungen über das logische Schließen - Gentzen - 1935
279	An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof - Andrews - 1986
162	Fibring logics - Gabbay - 1999
154	Present and Future - Past - 1967
135	Basic Proof Theory - Troelstra, Schwichtenberg - 2000
122	Complexity of Modal Logics - Spaan - 1993
98	Display logic - Belnap - 1982
94	M.: Hybrid logics: Characterization, interpolation and complexity - Areces, Blackburn, et al. - 2001
70	Internalizing labelled deduction - Blackburn
66	editor. The Handbook of Proof Theory - Buss - 1998
66	Proof theory: some applications of cut–elimination - Schwichtenberg - 1989
50	A generalization of analytic deduction via labelled deductive systems I: Basic substructural logics - D’Agostino, Gabbay - 1994
47	Systematization of the finite many-valued logics through the method of tableaux, The - Carnielli - 1987
45	The length of proofs - Pudlák - 1998
38	Fibring: Completeness preservation - Zanardo, Sernadas, et al. - 2001
34	Bounds for proof-search and speed-up in the predicate calculus - Statman - 1978
33	Labelled propositional modal logics: Theory and practic - Basin, Matthews, et al. - 1997
31	Labelled Deductive Systems, volume 1 - Gabbay - 1996
31	Labelled Non-Classical Logics - Viganò - 2000
31	Interpolants, cut elimination and flow graphs for the propositional calculus - Carbone - 1997
28	Sequent calculi for normal modal proposisional logics - Wansing - 1994
27	Advanced many-valued logics - Hähnle
24	Cut-elimination and Redundancy-elimination by Resolution - Baaz, Leitsch
21	Modal Logic, volume 53 of Cambridge Tracts - Blackburn, Rijke, et al. - 2001
19	The elimination theorem when modality is present - Curry - 1952
18	Untersuchungen "uber das Logische Schliessen I und II. Mathematische Zeitschrift - Gentzen - 1935
18	Probabilistic situation calculus - Mateus, Pacheco, et al. - 2000
17	Modulated fibring and the collapsing problem - Sernadas, Rasga, et al.
14	2-sequent calculus: A proof-theory of modalities - Masini - 1992
14	Reasoning about quantum systems - Mateus, Sernadas
14	Gentzen method in modal calculi - Onishi, Matsumoto - 1959
14	Two Applications of Logic in Mathematics - Takeuti - 1978
13	Hybrid completeness - Blackburn, Tzakova - 1998
12	Modal logic and classical logic - Benthem - 1985
12	Fibring labelled deduction systems - Rasga, Sernadas, et al.
10	Duplication of directed graphs and exponential blow up of proofs - Carbone - 1999
9	Indexed systems of sequents and cut-elimination - Mints - 1997
9	Induction and Analogy - Polya - 1954
8	Sequent-systems for modal logic - Dosen - 1985
8	Display Logic, in "Journal of Philosophical Logic - BELNAP, JR - 1982
8	Depth of proofs, depth of cut-formulas and complexity of cut formulas - Zhang - 1994
8	A cut-free Gentzen formulation of the modal logic S5 - Braüner - 2000
7	Improved Decision Procedures for the Modal Logics K, T and S4 - Hudelmaier - 1996
7	Sequent-systems for modal logic - Doˇsen - 1985
7	On the computational complexity of cut-elimination in linear logic - Mairson, Terui - 2003
6	Lower bounds for lengthening of proofs after cut-elimination - Orevkov - 1982
6	A Cut-free Gentzen-type System for the Modal Logic S5 - Sato - 1980
5	Labeled calculi and finite-valued logics - Baaz, Fermüller, et al. - 1998
5	LDS - natural deduction for substructural logics - Broda, Finger, et al. - 1996
5	Modal sequents for normal modal logics - Cerrato - 1993