Weakly maximal decidable structures (original) (raw)

Abstract

We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (9)

  1. J. R. Büchi. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 1-11. Stanford University Press, 1962.
  2. Kevin J. Compton. On rich words. In Combinatorics on words. Progress and perspectives, Proc. Int. Meet., Waterloo/Can. 1982, pages 39-61, 1983.
  3. Calvin C. Elgot and Michael O. Rabin. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. J. Symb. Log., 31(2):169-181, 1966.
  4. S. Feferman and R.L. Vaught. The first order properties of products of algebraic systems. Fundam. Math., 47:57-103, 1959.
  5. Dominique Perrin and Jean-Éric Pin. Infinite Words, volume 141 of Pure and Applied Math- ematics. Elsevier, 2004.
  6. Valentina S.Harizanov. Computably-theoretic complexity of countable structures. Bulletin of Symbolic Logic, 8:457-477, 2002.
  7. S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379-419, 1975.
  8. S. Soprunov. Decidable expansions of structures. Vopr. Kibern., 134:175-179, 1988. (in Russian).
  9. W. Thomas. Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht, number 1261 in Lect. Notes in Comput. Sci., pages 118-143. Springer-Verlag, 1997.