Non-Maximal Decidable Structures

Alexis Bès (1) , Patrick Cégielski (1)

1 LACL - Laboratoire d'Algorithmique Complexité et Logique

Given any infinite structure M with a decidable first-order theory, we give a sufficient condition in terms of the Gaifman graph of M, which ensures that M can be expanded with some non-definable predicate in such a way that the first-order theory of the expansion is still decidable.

Domaines: Logique [math.LO]

Alexis Bès, Patrick Cégielski. Non-Maximal Decidable Structures. 2007. ⟨hal-00155282⟩