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

@inproceedings{Oetsch2011GentzenTypeRS,
title={Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence},
author={Johannes Oetsch and Hans Tompits},
booktitle={LPNMR},
year={2011}
}
• Published in LPNMR 16 May 2011
• Computer Science
While the purpose of conventional proof calculi is to axiomatise the set of valid sentences of a logic, refutation systems axiomatise the invalid sentences. Such systems are relevant not only for proof-theoretic reasons but also for realising deductive systems for nonmonotonic logics. We introduce Gentzen-type refutation systems for two basic three-valued logics and we discuss an application of one of these calculi for disproving strong equivalence between answer-set programs.
8 Citations
Sequent-Type Proof Systems for Three-Valued Default Logic
This master's thesis introduces sequent-type calculi for a variant of default logic employing Lukasiewicz's three-valued logic as the underlying base logic, addressing some representational shortcomings of standard default logic.
A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur
• Computer Science
LPNMR
• 2019
This paper introduces a sequent-type calculus for a variant of default logic employing Łukasiewicz’s three-valued logic as the underlying base logic, and axiomatises brave reasoning for this version ofdefault logic.
A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur
This paper introduces a sequent-type calculus for a variant of default logic employing Lukasiewicz’s three-valued logic as the underlying base logic and axiomatises brave reasoning for this version ofdefault logic.
Refutation Systems: An Overview and Some Applications to Philosophical Logics
• Philosophy
• 2020
An overview with comprehensive references on the historical development of the theory of refutation systems is provided and some of their applications to philosophical logics are discussed.
On Axiomatic Rejection for the Description Logic ALC
• Computer Science
KDPD
• 2013
This paper presents a sound and complete sequent-type rejection system which axiomatises concept non-subsumption for the description logic $$\mathcal {ALC}$$.
Paraconsistency in classical logic
• Philosophy
Synthese
• 2017
Any decidable logic with a syntactically incomplete proof theory allows for a paraconsistent characterization of its set of theorems, and this has important bearing on the very nature of paraconsistency as standardly characterized.
Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic
• Computer Science
Axioms
• 2020
This paper introduces sequent-type calculi for two variants of default logic, viz., for three-valued default logic due to Radzikowska, and on the other hand, for disjunctive default Logic, due to Gelfond, Lifschitz, Przymusinski, and Truszczynski, which are introduced to address certain representational shortcomings of standard default logic.
Assessing Arguments with Schemes and Fallacies
• Philosophy, Computer Science
LPNMR
• 2019
It is shown that classical inference obtains when arguments are based on classical schemes (e.g. Hilbert axioms) and the notion of validity in the context of logic-based arguments along different aspects is clarified.

References

SHOWING 1-10 OF 31 REFERENCES
Refutation systems in modal logic
Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics and purely syntactic decision procedures for them are obtained.
Proving unprovability
• Michael L. Tiomkin
• Computer Science
[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
• 1988
A formal proof system for unprovability in the predicate calculi is developed that can be used to extend the 'negation by failure' of Pro Log, prevent infinite loops in a deductive data base or Prolog, or prove formulaes in nonmonotonic logic.
Sequent calculi for propositional nonmonotonic logics
• Computer Science
TOCL
• 2002
A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It consists of analytic sequent calculi where the details of nonmonotonic assumption making are modelled by an
A Sequent Calculus for Intuitionistic Default Logic
• Philosophy, Computer Science
WLP
• 1997
This paper presents a sequent calculus for default reasoning in the style of Bonatti with intuitionistic logic as the underlying logical structure and indicates that Bonatti's technique allows a very simple and intuitive speciication of the calculus, making it an ideal tool for implementation purposes.
PROVING UNPROVABILITY IN SOME NORMAL MODAL LOGIC
The present communication suggests deductive systems for the operator a of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of
Refutations and Proofs in S4
J. Łukasiewicz introduced the concept of a refutation calculus that axiomatizes the set of non-theorems of a logic and thereby eliminates the role of inductive reasoning in logic.
Proof-complexity results for nonmonotonic reasoning
• Computer Science
TOCL
• 2001
It is shown that there are classes of first-order formulae which have only extremely long “classical” proofs, but there are short proofs using nonmonotonic inferences which are much simpler than classical (cut-free) reasoning.
A Refutation Theory
A general theory of refutation systems is given. Some applications (concerning maximality and minimality in lattices of logics) are also discussed.
Strongly equivalent logic programs
• Computer Science
ACM Trans. Comput. Log.
• 2001
The main theorem shows that the verification of strong equivalence can be accomplished by cheching the equivalence of formulas in a monotonic logic, called the logic of here-and-there, which is intermediate between classical logic and intuitionistic logic.