Cut-free sequent calculi for C-systems with generalized finite-valued semantics
From MaRDI portal
Publication:5300580
DOI10.1093/logcom/exs039zbMath1267.03032OpenAlexW2155776066MaRDI QIDQ5300580
Anna Zamansky, Arnon Avron, Beata Konikowska
Publication date: 27 June 2013
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exs039
many-valued logicproof systemssequent calculiparaconsistent logicautomated deductionnon-deterministic semantics
Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50) Paraconsistent logics (03B53)
Related Items
Negative modalities, consistency and determinedness ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ Tools for the Investigation of Substructural and Paraconsistent Logics ⋮ Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics ⋮ Taming Paraconsistent (and Other) Logics ⋮ Four-valued paradefinite logics ⋮ Quasi-canonical systems and their semantics ⋮ Non-transitive correspondence analysis ⋮ A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE ⋮ Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation ⋮ Efficient reasoning with inconsistent information using C-systems ⋮ Paraconsistency and the need for infinite semantics ⋮ Three-Valued Paraconsistent Propositional Logics ⋮ A family of genuine and non-algebraisable C-systems ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ On Axioms and Rexpansions ⋮ Finite-valued semantics for canonical labelled calculi
This page was built for publication: Cut-free sequent calculi for C-systems with generalized finite-valued semantics
