Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus

DOI10.1016/j.ins.2010.06.004zbMath1202.03026MaRDI QIDQ991900

Guido Fiorino

Publication date: 8 September 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.06.004

zbMATH Keywords

automated theorem proving; Gödel logic; intermediate logics; tableau calculi; Dummett logic

Mathematics Subject Classification ID

03B35: Mechanization of proofs and logical operations

03B55: Intermediate logics

Uses Software

• ILTP

Cites Work

• Graph-based decision for Gödel-Dummett logics
• The ILTP problem library for intuitionistic logic
• Is there a need for fuzzy logic?
• Optimization techniques for propositional intuitionistic logic and their implementation
• Quantitative logic
• Semantical investigations in Heyting's intuitionistic logic
• Metamathematics of fuzzy logic
• Hypersequents, logical consequence and intermediate logics for concurrency
• A deterministic terminating sequent calculus for Godel-Dummett logic
• Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
• Hypersequent Calculi for Godel Logics -- a Survey
• Automated Reasoning
• Consistency of the Continuum Hypothesis. (AM-3)
• Decomposition proof systems for Gödel-Dummett logics
• An \(O(n\log n)\)-SPACE decision procedure for the propositional Dummett logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item