Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-28T03:17:58.197Z Has data issue: false hasContentIssue false
  • English
  • Français

Weakly maximal decidable structures

Published online by Cambridge University Press:  18 January 2008

Alexis Bès  and
Patrick Cégielski
Alexis Bès
Affiliation:
LACL, EA 4213, Université Paris-Est, Faculté des Sciences et Technologie, 61 avenue du Général de Gaulle, 94010 Créteil Cedex, France; [email protected]; [email protected]
Patrick Cégielski
Affiliation:
LACL, EA 4213, Université Paris-Est, Faculté des Sciences et Technologie, 61 avenue du Général de Gaulle, 94010 Créteil Cedex, France; [email protected]; [email protected]
Get access

Abstract

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


Keywords

Decidabilityfirst-order theoriesmonadic second-order theoriesmaximalityautomatarich words
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 1: A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday , January 2008 , pp. 137 - 145
Copyright
© EDP Sciences, 2007

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

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. Stanford University Press (1962) 1–11.
K.J. Compton, On rich words. In M. Lothaire, editor, Combinatorics on words. Progress and perspectives, Proc. Int. Meet., Waterloo, Canada (1982). Encyclopedia of Mathematics 17, Addison-Wesley (1983) 39–61.
C.C. Elgot and M.O. Rabin. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. J. Symbolic Logic 31 (1966) 169–181.
Feferman, S. and Vaught, R.L., The first order properties of products of algebraic systems. Fund. Math. 47 (1959) 57–103.
D. Perrin and J.-É. Pin, Infinite Words. Pure Appl. Math. 141 (2004).
Harizanov, V.S., Computably-theoretic complexity of countable structures. Bull. Symbolic Logic 8 (2002) 457–477. CrossRef
Shelah, S., The monadic theory of order. Ann. Math. 102 (1975) 379–419. CrossRef
Soprunov, S., Decidable expansions of structures. Vopr. Kibern. 134 (1988) 175–179 (in Russian).
Thomas, W., The theory of successor with an extra predicate. Math. Ann. 237 (1978) 121–132. CrossRef
Thomas, W., 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. Lect. Notes Comput. Sci. 1261 (1997) 118–143. CrossRef