The decidability of the theory of Boolean algebras with the quantifier “there exist infinitely many”
HTML articles powered by AMS MathViewer
- by Martin Weese PDF
- Proc. Amer. Math. Soc. 64 (1977), 135-138 Request permission
Abstract:
By using the decidability of the weak second order theory of linear order we get the decidability of the theory of Boolean algebras with the additional quantifier ${Q_0}$.References
- J. L. Bell and A. B. Slomson, Models and ultraproducts: An introduction, North-Holland Publishing Co., Amsterdam-London, 1969. MR 0269486
- G. Fuhrken, Skolem-type normal forms for first-order languages with a generalized quantifier, Fund. Math. 54 (1964), 291–302. MR 166085, DOI 10.4064/fm-54-3-291-302
- William Hanf, Primitive Boolean algebras, Proceedings of the Tarski Symposium (Proc. Sympos. Pure Math., Vol. XXV, Univ. California, Berkeley, Calif., 1971) Amer. Math. Soc., Providence, R.I., 1974, pp. 75–90. MR 0379182
- H. Läuchli, A decision procedure for the weak second order theory of linear order. , Contributions to Math. Logic (Colloquium, Hannover, 1966) North-Holland, Amsterdam, 1968, pp. 189–197. MR 0244026
- Michael O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35. MR 246760, DOI 10.1090/S0002-9947-1969-0246760-1
- Martin Weese, Zum Isomorphieproblem der Booleschen Algebren, Z. Math. Logik Grundlagen Math. 21 (1975), no. 5, 455–462. MR 404086, DOI 10.1002/malq.19750210162
Additional Information
- © Copyright 1977 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 64 (1977), 135-138
- MSC: Primary 02G05; Secondary 02B20
- DOI: https://doi.org/10.1090/S0002-9939-1977-0439613-7
- MathSciNet review: 0439613