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

DOI10.1007/S11787-006-0003-6zbMATH Open1118.03049OpenAlexW2037995299MaRDI QIDQ874747FDOQ874747

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

completenessmany-valued logicscut eliminationnondeterministic matricessoundness\(n\)-sequent proof systemfinite-valued logicsinformation sources logics

Mathematics Subject Classification ID

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

Cited In (27)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• Cut-free sequent calculi for C-systems with generalized finite-valued semantics 👍 👎
• Title not available (Why is that?) 👍 👎
• Intuitionistic sequent calculi for finitely many-valued logics 👍 👎
• Minimal sequent calculi for Lukasiewicz's finitely-valued logics 👍 👎

This page was built for publication: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874747)