Cut-free sequent calculi for C-systems with generalized finite-valued semantics

DOI10.1093/LOGCOM/EXS039MaRDI QIDQ5300580zbMATH OpenOpenAlexFDO

Authors Arnon Avron, Beata Konikowska, Anna Zamansky

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

zbMATH Keywords

automated deductionmany-valued logicparaconsistent logicsequent calculiproof systemsnon-deterministic semantics

Mathematics Subject Classification ID

Many-valued logic (03B50) Paraconsistent logics (03B53) Mechanization of proofs and logical operations (03B35)

Recommendations

• Modular construction of cut-free sequent calculi for paraconsistent logics
• Automated support for the investigation of paraconsistent and other logics
• Finite-valued semantics for canonical labelled calculi
• Analytic calculi for basic logics of formal inconsistency
• scientific article; zbMATH DE number 4091467

Cited in

(23)

• Quasi-canonical systems and their semantics
• Negative modalities, consistency and determinedness
• Paraconsistency and the need for infinite semantics
• Four-valued paradefinite logics
• Non-transitive correspondence analysis
• Three-valued paraconsistent propositional logics
• A family of genuine and non-algebraisable C-systems
• Taming paraconsistent (and other) logics: an algorithmic approach
• Automated support for the investigation of paraconsistent and other logics
• Modular construction of cut-free sequent calculi for paraconsistent logics
• Correspondence analysis and automated proof-searching for first degree entailment
• Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
• Studying sequent systems via non-deterministic multiple-valued matrices
• Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation
• Cut technique in valued relational systems: Mainsprings and applications
• Tools for the investigation of substructural and paraconsistent logics
• Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics
• Monadicity of non-deterministic logical matrices is undecidable
• 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
• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• Finite-valued semantics for canonical labelled calculi
• Efficient reasoning with inconsistent information using C-systems

This page was built for publication: Cut-free sequent calculi for C-systems with generalized finite-valued semantics

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