RAIRO-Theor. Inf. Appl.
Volume 42, Number 1, January-March 2008A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday
|Page(s)||137 - 145|
|Published online||18 January 2008|
Weakly maximal decidable structures
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@example.com; firstname.lastname@example.org
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.
Mathematics Subject Classification: 03B25 / 03C57 / 03D05
Key words: Decidability / first-order theories / monadic second-order theories / maximality / automata / rich words
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.