A deterministic terminating sequent calculus for Godel-Dummett logic
From MaRDI portal
Publication:4255973
DOI10.1093/jigpal/7.3.319zbMath0929.03057MaRDI QIDQ4255973
Publication date: 25 January 2000
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/7.3.319
sequent calculus; Kripke models; intuitionistic logic; Gödel-Dummett logic; deterministic proof-search procedure; terminating contraction-free calculus
Related Items
Proof analysis in intermediate logics, Graph-based decision for Gödel-Dummett logics, Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus, Terminating calculi for propositional Dummett logic with subformula property, Decision methods for linearly ordered Heyting algebras, A Multiple-Conclusion Calculus for First-Order Gödel Logic, A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains