A deterministic terminating sequent calculus for Godel-Dummett logic

DOI10.1093/jigpal/7.3.319zbMath0929.03057OpenAlexW2106490090MaRDI QIDQ4255973

Roy Dyckhoff

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

zbMATH Keywords

sequent calculusKripke modelsintuitionistic logicGödel-Dummett logicdeterministic proof-search procedureterminating contraction-free calculus

Mathematics Subject Classification ID

Structure of proofs (03F07) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

Graph-based decision for Gödel-Dummett logics, Proof analysis in intermediate logics, A Multiple-Conclusion Calculus for First-Order Gödel Logic, A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains, Decision methods for linearly ordered Heyting algebras, Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus, Terminating calculi for propositional Dummett logic with subformula property