Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-18T23:16:09.037Z Has data issue: false hasContentIssue false

Decidable properties of logical calculi and of varieties of algebras

from RESEARCH ARTICLES

Published online by Cambridge University Press:  30 March 2017

By
Larisa Maksimova
Edited by
Viggo Stoltenberg-Hansen  and
Jouko Väänänen
Viggo Stoltenberg-Hansen
Affiliation:
Uppsala Universitet, Sweden
Jouko Väänänen
Affiliation:
University of Helsinki
Get access

Summary

Abstract. We give an overview of decidable and strongly decidable properties over the propositional modal logics K, GL, S4, S5 and Grz, and also over the intuitionistic logic Int and the positive logic Int+.

We consider a number of important properties of logical calculi: consistency, tabularity, pretabularity, local tabularity, various forms of interpolation and of the Beth property. For instance, consistency is decidable over K and strongly decidable over S4 and Int; tabularity and pretabularity are decidable over S4, Int and Pos; interpolation is decidable over S4 and Int+ and strongly decidable over S5, Grz and Int; the projective Beth property is decidable over Int, Int+ and Grz, etc. Some complexity bounds are found.

In addition, we state that tabularity and many variants of amalgamation and of surjectivity of epimorphisms are base-decidable in varieties of closure algebras, of Heyting algebras and of relatively pseudocomplemented lattices.

Introduction. Propositional calculi are usually defined by systems of axioms schemes and rules of inference. Natural problems arising in general study of logical calculi, for example, the problemof equivalence or the problem of determining for arbitrary calculus whether it is consistent or not, are, in general, undecidable. The first undecidability results for propositional calculi were found by S. Linial and E. Post in 1949 [16]. In particular, it was proved that the property “to be an axiomatization of the classical propositional logic” is undecidable. In 1963 A. V. Kuznetsov [13] found an essential extension of this result. He proved that for every superintuitionistic logic L the property “to be an axiomatization of L” is undecidable. In particular, consistency andmany other properties of calculi are, in general, undecidable. In [3] A. V. Chagrov has given a survey of results on undecidable properties of propositional calculi. Here we concentrate on decidable properties.

When we restrict ourself by considering particular families of calculi, for instance, propositional calculi extending intuitionistic or some modal logic, many important properties of calculi appear to be decidable (see a survey in [4]). When the rules of inference are fixed, for any given finite system of additional axioms, one can effectively decide consistency problem for normal modal logics, tabularity and interpolation problems for extensions of the intuitionistic logic or of the modal system S4 and some other problems.

Type
Chapter
Information
Logic Colloquium '03 , pp. 146 - 166
Publisher: Cambridge University Press
Print publication year: 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] E. W., Beth, On Padoa's method in the theory of definitions, Indagationes Mathematicae, vol. 15 (1953), no. 4, pp. 330–339.Google Scholar
[2] A. V., Chagrov, Nontabularity - pretabularity, antitabularity, coantitabularity, Algebraic and logical constructions, Kalinin State University, Kalinin, 1989, pp. 105–111.
[3] A. V., Chagrov, Undecidable properties of superintuitionistic logics, Mathematical problems of cybernetics (S. V., Jablonsky, editor), vol. 5, Fizmatlit, Moscow, 1994, pp. 67–108.
[4] A. V., Chagrov and M., Zakharyaschev,Modal logics, Clarendon Press, Oxford, 1997.
[5] J., Czelakowski, Logical matrices and the amalgamation property, Studia Logica, vol. 41 (1982), no. 4, pp. 329–341.Google Scholar
[6] L., Esakia and V., Meskhi, Five critical systems, Theoria, vol. 40 (1977), pp. 52–60.Google Scholar
[7] M. J., Fisher and R. E., Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol. 18 (1979), pp. 194–211.Google Scholar
[8] J. Y., Halpern and Y., Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence, vol. 54 (1992), pp. 319–379.Google Scholar
[9] L., Henkin, D., Monk, and A., Tarski, Cylindric algebras, Part II, North Holland, Amsterdam, 1985.
[10] T., Hosoi, On intermediate logics I, Journal of the Faculty of Science University of Tokyo, Section Ia, vol. 14 (1967), pp. 293–312.Google Scholar
[11] D. S., Johnson, A catalog of complexity classes,Handbook of theoretical computer science, Volume A (J., van Leeuwen, editor), Elsevier, 1990, pp. 67–161.
[12] G., Kreisel, Explicit definability in intuitionistic logic, The Journal of Symbolic Logic, vol. 25 (1960), pp. 389–390.Google Scholar
[13] A. V., Kuznetsov, Undecidability of general problems of completeness, decidability and equivalence for propositional calculi, Algebra and Logic, vol. 2 (1963), pp. 47–66.Google Scholar
[14] A. V., Kuznetsov, Some properties of the lattice of varieties of pseudo-Boolean algebras, 11th Sovjet algebraic colloquium, abstracts (Kishinev, 1971), 1971, pp. 255–256.
[15] R. E., Ladner, The computational complexity of provability in systems of modal propositional logics, SIAMJournal of Computing, vol. 6 (1977), no. 3, pp. 467–480.Google Scholar
[16] S., Linial and E. L., Post, Recursive unsolvability of the deducibility, Tarski's completeness and independence of axioms problems in the propositional calculus, Bulletin of American Mathematical Society, vol. 55 (1949), p. 50.Google Scholar
[17] D. C., Makinson, On some completeness theorem in modal logic, Zeitschrift fuer Mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 379–384.Google Scholar
[18] L. L., Maksimova, Pretabular superintuitionistic logics, Algebra and Logic, vol. 11 (1972), pp. 558–570.Google Scholar
[19] L. L., Maksimova,Modal logics of finite slices, Algebra and Logic, vol. 14 (1975), pp. 188–197.Google Scholar
[20] L. L., Maksimova, Pretabular extensions of Lewis S4, Algebra and Logic, vol. 14 (1975), pp. 16–33.Google Scholar
[21] L. L., Maksimova, Craig's interpolation theorem and amalgamable varieties, Doklady AN SSSR, vol. 237 (1977), pp. 1281–1284.Google Scholar
[22] L. L., Maksimova, Craig's theorem in superintuitionistic logics and amalgamable varieties of Pseudo- Boolean algebras, Algebra i Logika, vol. 16 (1977), no. 6, pp. 643–681.Google Scholar
[23] L. L., Maksimova, Interpolation theorems in modal logics and amalgamable varieties of Topoboolean algebras, Algebra i Logika, vol. 18 (1979), no. 5, pp. 556–586.
[24] L. L., Maksimova, On a classification of modal logics, Algebra and Logic, vol. 18 (1979), no. 3, pp. 328–340.Google Scholar
[25] L. L., Maksimova, Interpolation theorems in modal logics. Sufficient conditions, Algebra i Logika, vol. 19 (1980), no. 2, pp. 194–213.Google Scholar
[26] L. L., Maksimova, Absence of interpolation in modal companions of Dummett's logic, Algebra i logika, vol. 21 (1982), pp. 690–694.Google Scholar
[27] L. L., Maksimova, The Beth properties, interpolation, and amalgamability in varieties of modal algebras, Doklady Akademii Nauk SSSR, vol. 319 (1991), no. 6, pp. 1309–1312.Google Scholar
[28] L. L., Maksimova, An analog of the Beth theorem in normal extensions of the modal logic K4, Siberian Mathematical Journal, vol. 33 (1992), no. 6, pp. 118–130.Google Scholar
[29] L. L., Maksimova, Explicit and implicit definability in modal and related logics, Bulletin of the Section of Logic, vol. 27 (1998), no. 1/2, pp. 36–39.Google Scholar
[30] L. L., Maksimova, Intuitionistic logic and implicit definability, Annals of Pure and Applied Logic, vol. 105 (2000), pp. 83–102.Google Scholar
[31] L. L., Maksimova, Strongly decidable properties of modal and intuitionistic calculi, Logic Journal of the IGPL, vol. 8 (2000), pp. 797–819.Google Scholar
[32] L. L., Maksimova, Decidability of projective Beth's property in varieties of Heyting algebras, Algebra and Logic, vol. 40 (2001), pp. 290–301.Google Scholar
[33] L. L., Maksimova, Complexity of interpolation and related problems in positive calculi, The Journal of Symbolic Logic, vol. 67 (2002), pp. 397–408.Google Scholar
[34] L. L., Maksimova, Implicit definability and positive logics, Algebra and Logic, vol. 42 (2003), pp. 65–93.Google Scholar
[35] L. L., Maksimova and A., Voronkov, Complexity of some problems in modal and intuitionistic calculi,Computer science logic (Proc. of 17th Intern.Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Goedel Colloquium, KGC 2003, Vienna, Austria August 25-30, 2003) (M., Baaz and J. M., Makowsky, editors), Lecture Notes in Computer Science, vol. 2803, Springer, 2003, pp. 397–412.
[36] C. H., Papadimitriou, Computational complexity, Addison-Wesley, Reading, Massachusets, 1994.
[37] V. R., Pratt, Models of program logics, Proceedings 20th IEEE symposium on foundations of computer science, 1979, pp. 115–122.
[38] W., Rautenberg, Der Verband der normalen verzweigten Modallogiken, Mathematische Zeitschrift, vol. 156 (1977), pp. 123–140.Google Scholar
[39] V., Rybakov, Completeness of modal logics of prefinite width, Matematicheskie Zametki, vol. 32 (1982), pp. 223–228.Google Scholar
[40] V., Rybakov, Admissibility of logical inference rules, Elsevier, Amsterdam, New York, 1997.
[41] K., Segerberg, An essay in classical modal logics, Uppsala, 1971.
[42] E., Spaan, Complexity of modal logics, Dissertation, Institute for Logic, Language and Computation, University of Amsterdam, 1992.
[43] R., Statman, Intuitionistic logic is polynomial-space complete, Theoretical Computer Science, vol. 9 (1979), pp. 67–72.Google Scholar
[44] M. I., Verhozina, Intermediate positive logics, Algorithmic problems of algebraic systems, Irkutsk, 1978, pp. 13–25.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×