Sequent-type rejection systems for finite-valued non-deterministic logics

DOI10.1080/11663081.2023.2244367OpenAlexW4385954204MaRDI QIDQ6080581

Hans Tompits, Unnamed Author

Publication date: 30 October 2023

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2023.2244367

zbMATH Keywords

proof theoryparaconsistent logicsfinite-valued logicsaxiomatic rejectionsequent-type systems

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof complexity of propositional default logic
• The method of axiomatic rejection for the intuitionistic propositional logic
• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• Non-deterministic semantics for logics with a consistency operator
• Proof systems for reasoning about computation errors
• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Minimally inconsistent LP
• The value of the four values
• Refutation systems in modal logic
• The many valued and nonmonotonic turn in logic
• The complexity of reasoning for fragments of default logic
• Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence
• Non-deterministic Multiple-valued Structures
• Methoden zur Axiomatisierung beliebiger Aussagen- und Prädikatenkalküle
• A Way to Simplify Truth Functions
• Ein System des Verknüpfenden Schliessens
• Proof-complexity results for nonmonotonic reasoning
• Processing Information from a Set of Sources
• Sequent calculi for default and autoepistemic logics
• Logics of Formal Inconsistency
• The Complexity of Theorem Proving in Autoepistemic Logic
• Sequents in many valued logic I
• Multi-valued Calculi for Logics Based on Non-determinism
• Sequent calculi for propositional nonmonotonic logics
• The Problem of Simplifying Truth Functions

This page was built for publication: Sequent-type rejection systems for finite-valued non-deterministic logics