2000 character limit reached
On the existence property over a predicate
Published 27 Feb 2025 in math.LO | (2502.20236v1)
Abstract: We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property: any model of P occurs as the P-part of some model of T. This generalizes results of Lachlan (on stable theories), Hodges (on relatively categorical abelian groups), and Afshordel (on difference fields of characteristic 0).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.