Weakly maximal decidable structures

13 years 11 months ago

Download hal.archives-ouvertes.fr

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. 1991 Mathematics Subject Classification. 03B25, 03C57, 03D05.

Alexis Bès, Patrick Cégielski

Real-time Traffic

Communications | ITA 2008 | Mathematics Subject Classification | Order Theory |

claim paper

» BondFree Languages Formalizations Maximality and Construction Methods

» Weak Equivalence in Propositional Calculus

» Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees

» Transforming structures by set interpretations

» A Simple LinearTime Recognition Algorithm for Weakly QuasiThreshold Graphs

» Ordered Sets in the Calculus of Data Structures

» Weak graph colorings distributed algorithms and applications

» Building a Calculus of Data Structures

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	ITA
Authors	Alexis Bès, Patrick Cégielski

Comments (0)

Sciweavers

Weakly maximal decidable structures

Communications | ITA 2008 | Mathematics Subject Classification | Order Theory |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers