Graph-based decision for Gödel-Dummett logics
From MaRDI portal
Publication:877886
DOI10.1007/s10817-006-9047-9zbMath1121.03021OpenAlexW1964353152MaRDI QIDQ877886
Publication date: 4 May 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-006-9047-9
Fuzzy logic; logic of vagueness (03B52) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Intermediate logics (03B55)
Related Items (3)
A family of Gödel hybrid logics ⋮ Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus ⋮ Terminating calculi for propositional Dummett logic with subformula property
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A propositional calculus with denumerable matrix
- Contraction-free sequent calculi for intuitionistic logic
- 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
- Computer Science Logic
- Automated Reasoning
- Bounding Resource Consumption with Gödel-Dummett Logics
- Logic for Programming, Artificial Intelligence, and Reasoning
- A Theorem on Boolean Matrices
- Decomposition proof systems for Gödel-Dummett logics
This page was built for publication: Graph-based decision for Gödel-Dummett logics