Abstract
We present tableau calculi for the logics D k (k≥2) semantically characterized by the classes of Kripke models built on finite k-ary trees. Our tableau calculi use the signs T and F, some tableau rules for Intuitionistic Logic and two rules formulated in a hypertableau fashion. We prove the Soundness and Completeness Theorems for our calculi. Finally, we use them to prove the main properties of the logics D k, in particular their constructivity and their decidability.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Avellone, M. Ferrari, and P. 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.
A. Avellone, P. Miglioli, U. Moscato, and M. Ornaghi. Generalized tableau systems for intermediate propositional logics. In D. Galmiche, editor, Proceedings of the 6th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods: Tableaux’ 97, volume 1227 of LNAI, pages 43–61. Springer-Verlag, 1997.
A. Avron. Hypersequents, logical consequence and intermediate logics for concurrency. Annals for Mathematics and Artificial Intelligence, 4:225–248, 1991.
M. Baaz and C. G. Fermüller. Analytic calculi for projective logics. Lecture Notes in Computer Science, 1617:36–50, 1999.
A. Chagrov and M. Zakharyaschev. Modal Logic. Oxford University Press, 1997.
A. Ciabattoni and M. Ferrari. Hypertableau and path-hypertableau calculi for some families of intermediate logics. In R. Dyckhoff, editor, TABLEAUX 2000, Automated Reasoning with Analytic Tableaux and Related Methods, volume 1947 of LNAI, pages 160–174. Springer-Verlag, 2000.
A. Ciabattoni and M. Ferrari. Hypersequent calculi for some intermediate logics with bounded Kripke models. Journal of Logic and Computation, 11(2):283–294, 2001.
R. Dyckhoff. A deterministic terminating sequent calculus for Gödel-Dummett logic. Logic Journal of the IGPL, 7(3):319–326, 1999.
M. Ferrari and P. Miglioli. Counting the maximal intermediate constructive logics. Journal of Symbolic Logic, 58(4):1365–1401, 1993.
G. Fiorino. An O(n log n)-space decision procedure for the propositional Dummett Logic. Journal of Automated Reasoning, 27(3):297–311, 2001.
G. Fiorino. Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics. Journal of Logic and Computation, To appear.
M.C. Fitting. Intuitionistic Logic, Model Theory and Forcing. North-Holland, 1969.
D.M. Gabbay and D.H.J. De Jongh. A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property. Journal of Symbolic Logic, 39:67–78, 1974.
P. Hájek. Metamathematics of fuzzy logic. Kluwer, 1998.
D. Pearce. A new logical characterization of stable models and answer sets. In J. Dix, L.M. Pereira, and T. Przymusinski, editors, Non-Monotonic Extensions of Logic Programming, volume 1216 of LNAI, pages 57–70. Springer-Verlag, 1997.
D. Pearce. Stable inference as intuitionistic validity. Journal of Logic Programming, 38(1):79–91, 1999.
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
Ferrari, M., Fiorentini, C., Fiorino, G. (2002). Tableau Calculi for the Logics of Finite k-Ary Trees. In: Egly, U., Fermüller, C.G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2002. Lecture Notes in Computer Science(), vol 2381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45616-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-45616-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43929-5
Online ISBN: 978-3-540-45616-2
eBook Packages: Springer Book Archive