Hostname: page-component-8448b6f56d-tj2md Total loading time: 0 Render date: 2024-04-19T21:24:32.966Z Has data issue: false hasContentIssue false

Decidability problem for finite Heyting algebras

Published online by Cambridge University Press:  12 March 2014

Katarzyna Idziak
Affiliation:
Department of Logic, Jagiellonian University, Cracow, Poland
Pawel M. Idziak
Affiliation:
Department of Logic, Jagiellonian University, Cracow, Poland

Abstract

The aim of this paper is to characterize varieties of Heyting algebras with decidable theory of their finite members. Actually we prove that such varieties are exactly the varieties generated by linearly ordered algebras. It contrasts to the result of Burris [2] saying that in the case of whole varieties, only trivial variety and the variety of Boolean algebras have decidable first order theories.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1988

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

REFERENCES

[1]Balbes, R. and Dwinger, Ph., Distributive lattices, University of Missouri Press, Columbia, Missouri, 1974.Google Scholar
[2]Burris, S., Boolean constructions, Universal algebra and lattice theory (Puebla, 1983), Lecture Notes in Mathematics, vol. 1004, Springer-Verlag, Berlin, 1983, pp. 6790.CrossRefGoogle Scholar
[3]Burris, S. and Sankappanavar, H. P., A course in universal algebra, Springer-Verlag, Berlin, 1981.CrossRefGoogle Scholar
[4]Hecht, T. and Katrinák, T., Equational classes of relative Stone algebras, Notre Dame Journal of Formal Logic, vol. 13 (1972), pp. 248254.CrossRefGoogle Scholar
[5]Horn, A., Logic with truth values in a linearly ordered Heyting algebra, this Journal, vol. 34 (1969), pp. 395408.Google Scholar
[6]Hosoi, T., A criterion for the separable axiomatization of Gödel's Sn, Proceedings of the Japan Academy, vol. 43 (1967), pp. 365368.Google Scholar
[7]Idziak, K., Undecidability of Brouwerian semilattices, Algebra Universalis, vol. 22 (1986), pp. 298301.CrossRefGoogle Scholar
[8]Jankov, V. A., Constructing a sequence of strongly independent superintuitionistic calculi, Soviet Mathematics-Doklady, vol. 9 (1968), pp. 806807.Google Scholar
[9]de Jongh, D. H. J. and Troelstra, A. S., On the connection of partially ordered sets with some pseudo-Boolean algebras, Indagationes Mathematicae, vol. 28 (1966), pp. 317329.CrossRefGoogle Scholar
[10]Köhler, P., Brouwerian semilattices, Transactions of the American Mathematical Society, vol. 268 (1981), pp. 103126.CrossRefGoogle Scholar
[11]Nagata, S., A series of successive modifications of Peirce's rule, Proceedings of the Japan Academy, vol. 42 (1966), pp. 859861.Google Scholar
[12]Ono, H., Kripke models and intermediate logics, Publications of the Research Institute for Mathematical Sciences of Kyoto University, vol. 6 (1970), pp. 461476.CrossRefGoogle Scholar
[13]Rabin, M. O., A simple method for undecidability proofs and some applications, Logic, methodology and philosophy of science (Jerusalem, 1964; Bar-Hillel, Y., editor), North-Holland, Amsterdam, 1965, pp. 5668.Google Scholar
[14]Rabin, M. O., Decidability of second order theories and automata on infinite trees, Transactions of the American Mathematical Society, vol. 141 (1969), pp. 135.Google Scholar
[15]Rabin, M. O., Decidable theories, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 595629.CrossRefGoogle Scholar
[16]Tarski, A., Arithmetical classes and types of Boolean algebras, Bulletin of the American Mathematical Society, vol. 55 (1949), p. 64.Google Scholar
[17]Troelstra, A. S., On intermediate propositional logics, Indagationes Mathematicae, vol. 27 (1965), pp. 141152.CrossRefGoogle Scholar