Given a complete theory $T$ and a subset $Y \subseteq X^k$, we precisely determine the {\em worst case complexity}, with respect to further monadic expansions, of an expansion $(M,Y)$ by $Y$ of a model $M$ of $T$ with universe $X$. In particular, although by definition monadically stable/NIP theories are robust under arbitrary monadic expansions, we show that monadically NFCP (equivalently, mutually algebraic) theories are the largest class that is robust under anything beyond monadic expansions. We also exhibit a paradigmatic structure for the failure of each of monadic NFCP/stable/NIP and prove each of these paradigms definably embeds into a monadic expansion of a sufficiently saturated model of any theory without the corresponding proper...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
We give an example of two ordered structures M, N in the same language L with the same universe, the...
We prove that for any monotone class of finite relational structures, the first-order theory of the ...
We characterize nonstandard models of ZF (of arbitrary cardinality) that can be expanded to Goedel-B...
Abstract. We classify the computability-theoretic complexity of two index sets of classes of first-o...
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that i...
Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous stru...
We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is th...
In this work we consider several instances of the following problem: "how complicated can the isomor...
We show that if $X$ is virtually any classical fractal subset of $\mathbb{R}^n$, then $(\mathbb{R},<...
In this note, we survey some recent results on definable sets in ordered Abelian groups of finite bu...
This work shows that for each i ∈ ω there exists a Σ1i-hard ω-word language definable in Monadic Sec...
AbstractThe projective plane of Baldwin (Amer. Math. Soc. 342 (1994) 695) is model complete in a lan...
The concept of model completeness for a first order theory T was first formulated by A. ROBINSON [6]...
The constraint satisfaction problem (CSP) over a structure A with a finite relational signature, den...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
We give an example of two ordered structures M, N in the same language L with the same universe, the...
We prove that for any monotone class of finite relational structures, the first-order theory of the ...
We characterize nonstandard models of ZF (of arbitrary cardinality) that can be expanded to Goedel-B...
Abstract. We classify the computability-theoretic complexity of two index sets of classes of first-o...
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that i...
Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous stru...
We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is th...
In this work we consider several instances of the following problem: "how complicated can the isomor...
We show that if $X$ is virtually any classical fractal subset of $\mathbb{R}^n$, then $(\mathbb{R},<...
In this note, we survey some recent results on definable sets in ordered Abelian groups of finite bu...
This work shows that for each i ∈ ω there exists a Σ1i-hard ω-word language definable in Monadic Sec...
AbstractThe projective plane of Baldwin (Amer. Math. Soc. 342 (1994) 695) is model complete in a lan...
The concept of model completeness for a first order theory T was first formulated by A. ROBINSON [6]...
The constraint satisfaction problem (CSP) over a structure A with a finite relational signature, den...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
We give an example of two ordered structures M, N in the same language L with the same universe, the...
We prove that for any monotone class of finite relational structures, the first-order theory of the ...