Sequent of relations calculi: a framework for analytic deduction in many-valued logics

Authors:
Matthias Baaz;Agata Ciabattoni;Christian G. Fermüller
Affiliations:
Technische Universität Wien, A-1040 Vienna, Austria;Technische Universität Wien, A-1040 Vienna, Austria;Technische Universität Wien, A-1040 Vienna, Austria
Venue:
Beyond two
Year:
2003

Citing 7
Cited 2

Basic proof theory

Basic proof theory
The method of hypersequents in the proof theory of propositional non-classical logics

Logic: from foundations to applications
Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM (JACM)
A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus

TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Ordered Chaining for Total Orderings

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Automated deduction for many-valued logics

Handbook of automated reasoning
Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic

ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic

A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On the (fuzzy) logical content of CADIAG-2

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general framework that allows to construct systematically analytic calculi for a large family of (propositional) many-valued logics -- called projective logics -- characterized by a special format of their semantics. All finite-valued logics as well as infinite-valued Gödel logic are projective. As a case-study, sequent of relations calculi for Gödel logics are derived. A comparison with some other analytic calculi is provided.