A Multiple-Conclusion Calculus for First-Order Gödel Logic
From MaRDI portal
Publication:3007648
DOI10.1007/978-3-642-20712-9_36zbMath1332.03004MaRDI QIDQ3007648
Publication date: 17 June 2011
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_36
Cites Work
- Unnamed Item
- Semantic trees for Dummett's logic LC
- Semantical investigations in Heyting's intuitionistic logic
- Metamathematics of fuzzy logic
- Gentzen-type systems, resolution and tableaux
- Hypersequents, logical consequence and intermediate logics for concurrency
- First-order Gödel logics
- Decision methods for linearly ordered Heyting algebras
- Proof theory for fuzzy logics
- A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
- A propositional calculus with denumerable matrix
- Intuitionistic fuzzy logic and intuitionistic fuzzy set theory
- 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
- Decomposition proof systems for Gödel-Dummett logics