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

DOI10.1007/978-3-642-20895-9_28zbMATH Open1327.03018OpenAlexW1566498025MaRDI QIDQ3003264FDOQ3003264

Hans Tompits, Johannes Oetsch

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)

Cited In (2)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎

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)