Graph-based decision for Gödel-Dummett logics
From MaRDI portal
Publication:877886
DOI10.1007/S10817-006-9047-9zbMATH Open1121.03021OpenAlexW1964353152MaRDI QIDQ877886FDOQ877886
Authors: Dominique Larchey-Wendling 
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
Recommendations
Fuzzy logic; logic of vagueness (03B52) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Intermediate logics (03B55)
Cites Work
- A Theorem on Boolean Matrices
- Title not available (Why is that?)
- A propositional calculus with denumerable matrix
- Automated Reasoning
- Bounding Resource Consumption with Gödel-Dummett Logics
- Hypersequent Calculi for Godel Logics -- a Survey
- Logic for Programming, Artificial Intelligence, and Reasoning
- Contraction-free sequent calculi for intuitionistic logic
- Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
- A deterministic terminating sequent calculus for Godel-Dummett logic
- Gödel-Dummett counter-models through matrix computation
- Title not available (Why is that?)
- Computer Science Logic
- Decomposition proof systems for Gödel-Dummett logics
Cited In (8)
- Terminating calculi for propositional Dummett logic with subformula property
- The limits of decidability for first order logic on CPDA graphs
- Title not available (Why is that?)
- Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus
- Gödel-Dummett counter-models through matrix computation
- Automated Reasoning
- Title not available (Why is that?)
- A family of Gödel hybrid logics
This page was built for publication: Graph-based decision for Gödel-Dummett logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877886)
