Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics

DOI10.1007/s11787-006-0003-6zbMath1118.03049OpenAlexW2037995299MaRDI QIDQ874747

Arnon Avron, Beata Konikowska, Jonathan Ben-Naim

Publication date: 10 April 2007

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11787-006-0003-6

zbMATH Keywords

completenesscut eliminationsoundnessmany-valued logicsnondeterministic matrices\(n\)-sequent proof systemfinite-valued logicsinformation sources logics

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Many-valued logic (03B50)

Related Items

Proof search on bilateralist judgments over non-deterministic semantics, Automated Support for the Investigation of Paraconsistent and Other Logics, An unexpected Boolean connective, Correspondence analysis and automated proof-searching for first degree entailment, Taming Paraconsistent (and Other) Logics, Self-extensional three-valued paraconsistent logics, Two, Many, and Differently Many, Sequent-type rejection systems for finite-valued non-deterministic logics, Axiomatizing non-deterministic many-valued generalized consequence relations, Non-transitive correspondence analysis, The normal and self-extensional extension of Dunn-Belnap logic, A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE, Tree-like proof systems for finitely-many valued non-deterministic consequence relations, Generalizing functional completeness in Belnap-Dunn logic, Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation, Processing Information from a Set of Sources, Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics, Proof systems for reasoning about computation errors, Cut-free sequent calculus and natural deduction for the tetravalent modal logic, Three-Valued Paraconsistent Propositional Logics, Exactly true and non-falsity logics meeting infectious ones, Finite two-dimensional proof systems for non-finitely axiomatizable logics, On Axioms and Rexpansions