Undecidable theories in stationary logic

Seese, Detlef; Tuschik, Peter; Weese, Martin

doi:10.1090/S0002-9939-1982-0643750-3

Undecidable theories in stationary logic
HTML articles powered by AMS MathViewer

by Detlef Seese, Peter Tuschik and Martin Weese

Proc. Amer. Math. Soc. 84 (1982), 563-567

DOI: https://doi.org/10.1090/S0002-9939-1982-0643750-3

PDF | Request permission

Abstract:

It is shown that the theories of the following classes become undecidable in stationary logic: Well orderings with one unary predicate, linear orderings, and Boolean algebras. This is done by interpreting the theory of symmetric reflexive graphs.

References

Jon Barwise, Matt Kaufmann, and Michael Makkai, Stationary logic, Ann. Math. Logic 13 (1978), no. 2, 171–224. MR 486629, DOI 10.1016/0003-4843(78)90003-7
Andreas Baudisch, Detlef Seese, Hans-Peter Tuschik, and Martin Weese, Decidability and generalized quantifiers, Mathematical Research, vol. 3, Akademie-Verlag, Berlin, 1980. MR 588326
J. Richard Büchi, The monadic second order theory of $\omega _{i}$, The monadic second order theory of all countable ordinals (Decidable theories, II), Lecture Notes in Math., Vol. 328, Springer, Berlin, 1973, pp. 1–127. MR 0476471
Paul C. Eklof and Alan H. Mekler, Stationary logic of finitely determinate structures, Ann. Math. Logic 17 (1979), no. 3, 227–269. MR 556893, DOI 10.1016/0003-4843(79)90009-3
John E. Hutchinson, Order types of ordinals in models of set theory, J. Symbolic Logic 41 (1976), no. 2, 489–502. MR 403958, DOI 10.2307/2272250
Handbook of mathematical logic, Studies in Logic and the Foundations of Mathematics, vol. 90, North-Holland Publishing Co., Amsterdam, 1977. Edited by Jon Barwise; With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis and A. S. Troelstra. MR 457132
D. G. Seese, Stationary logic and ordinals, Trans. Amer. Math. Soc. 263 (1981), no. 1, 111–124. MR 590414, DOI 10.1090/S0002-9947-1981-0590414-4