Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence

DOI10.1007/978-3-642-20895-9_28MaRDI QIDQ3003264zbMATHOpenAlexFDO

Authors Johannes Oetsch, Hans Tompits

Publication date 26 May 2011

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20895-9_28

Mathematics Subject Classification ID

Many-valued logic (03B50) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 4106806
• Proof systems for 3-valued logics based on Gödel's implication
• Strong Three-Valued Paraconsistent Logics
• On the axiomatization of three-valued propositional logic
• scientific article; zbMATH DE number 60837
• The strong completeness of a system based on Kleene's strong three-valued logic
• Three-valued paraconsistent propositional logics
• Two Genuine 3-Valued Paraconsistent Logics
• scientific article; zbMATH DE number 1775473

Cited in

(2)

• Paraconsistency in classical logic
• Sequent-type rejection systems for finite-valued non-deterministic logics

This page was built for publication: Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence

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