Abstract
We present a tableau calculus for propositional Dummett logic, also known as LC (Linear Chain), where the depth of the deductions is linearly bounded by the length of the formulas to be proved. We then show that it is possible to decide propositional Dummett logic in O(nlog n)-SPACE.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avellone, A., Ferrari, M. and Miglioli, P.: Duplication-free tableau calculi and related cutfree sequent calculi for the interpolable propositional intermediate logics, Logic J. IGPL 7(4) (1999), 447–480.
Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency, Ann. Math. Artificial Intelligence 4 (1991), 225–248.
Baaz, M. and Fermüller, C. G.: Analytic calculi for projective logics, in N. V. Murray (ed.), '99, Lecture Notes in Comput. Sci. 1617, Springer, 1999, pp. 36–50.
Chagrov, A. and Zakharyaschev, M.: Modal Logic, Oxford University Press, 1997.
Corsi, G.: A cut-free calculus for Dummett's LC quantified, Z. Math. Logik Grundlag. Math. 35 (1989), 289–301.
Dummett, M.: A propositional calculus with a denumerable matrix, J. Symbolic Logic 24 (1959), 96–107.
Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic, J. Symbolic Logic 57(3) (1992), 795–807.
Dyckhoff, R.: A deterministic terminating sequent calculus for Gödel-Dummett logic, Logic J. IGPL 7(3) (1999), 319–326.
Fitting, M. C.: Intuitionistic Logic, Model Theory and Forcing, North-Holland, 1969.
Gödel, K.: On the intuitionistic propositional calculus, in S. Feferman et al. (eds), Collected Works, Vol. 1, Oxford University Press, 1986.
Hudelmaier, J.: Bounds for Cut Elimination in Intuitionistic Propositional Logic, Ph.D. Thesis, Universität Tubingen, 1989.
Hudelmaier, J.: Bounds for cut elimination in intuitionistic propositional logic, Arch. Math. Logic 31 (1992), 331–354.
Hudelmaier, J.: An O(n log n)-SPACE decision procedure for intuitionistic propositional logic, J. Logic Comput. 3(1) (1993), 63–75.
Ladner, R. E.: The computational complexity of provability in systems of modal propositional logic, SIAM J. Comput. 6(3) (1977), 467–480.
Miglioli, P., Moscato, U. and Ornaghi, M.: How to avoid duplications in refutation systems for intuitionistic logic and Kuroda logic, in K. Broda, M. D'Agostino, R. Goré, R. Johnson, and S. Reeves (eds), Theorem Proving with Analytic Tableaux and Related Methods: 3rd International Workshop, Abingdon, U.K., May 1994, pp. 169–187.
Miglioli, P., Moscato, U. and Ornaghi, M.: An improved refutation system for intuitionistic predicate logic, J. Automated Reasoning 12 (1994), 361–373.
Miglioli, P., Moscato, U. and Ornaghi, M.: Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic, Logic J. IGPL 5(1) (1997), 145–167.
Statman, R.: Intuitionistic logic is polynomial-space complete, Theoret. Comput. Sci. 9 (1977), 67–72.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fiorino, G. An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic. Journal of Automated Reasoning 27, 297–311 (2001). https://doi.org/10.1023/A:1017515831550
Issue Date:
DOI: https://doi.org/10.1023/A:1017515831550