Abstract
We present an algorithm for deciding Gödel-Dummett logic. The originality of this algorithm comes from the combination of proof-search in sequent calculus, which reduces a sequent to a set of pseudo-atomic sequents, and counter-model construction of such pseudo-atomic sequents by a fixpoint computation. From an analysis of this construction, we deduce a new logical rule [⊃ N ] which provides shorter proofs than the rule [⊃ R ] of G4-LC. We also present a linear implementation of the counter-model generation algorithm for pseudo-atomic sequents.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alessendro Avellone, Mauro Ferrari, and Pierangelo Miglioli. Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic Journal of the IGPL, 7(4):447–480, 1999.
Arnon Avron. A Tableau System for Gödel-Dummett Logic Based on a Hyper-sequent Calculus. In Roy Dyckhoff, editor, Automated Reasoning with Analytic Tableaux and Related Methods, volume 1847 of Lecture Notes in Artificial Intelligence, pages 98–111, St Andrews, Scotland, July 2000.
L. Peter Deutsch and Daniel G. Bobrow. A Efficient Incremental Automatic Garbage Collector. Communications of the ACM, 19(9):522–526, September 1976.
Michael Dummett. A Propositional Calculus with a Denumerable matrix. Journal of Symbolic Logic, 24:96–107, 1959.
Roy Dyckhoff. Contraction-free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic, 57(3):795–807, 1992.
Roy Dyckhoff. A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic. Logical Journal of the IGPL, 7:319–326, 1999.
Fiorino. An O(n log n)-SPACE decision procedure for the propositional Dummett Logic. to appear in Journal of Automated Reasoning.
Didier Galmiche and Dominique Larchey-Wendling. Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. In Asian Computing Science Conference, ASIAN’99, volume 1742 of Lecture Notes in Computer Science, pages 101–102, Phuket, Thaïland, December 1999.
Kurt Gödel. Zum intuitionistischen Aussagenkalkül. Ergeb. Math. Koll, 4:40, 1933.
P. Hajek. Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, 1998.
Jörg Hudelmaier. An O(n log n)-space decision procedure for Intuitionistic Propositional Logic. Journal of Logic and Computation, 3(1):63–75, 1993.
Dominique Larchey, Daniel Méry, and Didier Galmiche. STRIP: Structural Sharing for efficient Proof-Search. In International Joint Conference on Automated Reasoning, IJCAR 2001, volume 2083 of Lecture Notes in Artificial Intelligence, pages 696–700, Siena, Italy, January 2001.
O. Sonobe. A Gentzen-type Formulation of Some Intermediate Propositional Logics. Journal of Tsuda College, 7:7–14, 1975.
A. Visser. On the Completeness Principle: A study of provability in Heyting’s arithmetic. Annals of Mathematical Logic, 22:263–295, 1982.
Klaus Weich. Decisions Procedures for Intuitionistic Logic by Program Extraction. In International Conference TABLEAUX’98, volume 1397 of Lecture Notes in Artificial Intelligence, pages 292–306, Oisterwijk, The Netherlands, May 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larchey-Wendling, D. (2002). Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-45620-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43931-8
Online ISBN: 978-3-540-45620-9
eBook Packages: Springer Book Archive