Simple closure (source code)

= Simple closure
{title2=$M\preccurlyeq_s N$}

= Simply closed
{synonym}

A <substructure> $M\subseteq N$ is simply closed in $N$ when every formula
$$
\exists x_1\cdots\exists x_r\,\theta(x_1,\ldots,x_r,\mathbf a),
$$
with <quantifier-free formula> $\theta$ and parameters $\mathbf a$ from $M$, that is true in $N$ is already true in $M$. This is existential closure in the specified extension. It is weaker than being an <elementary substructure>, which preserves arbitrary <first-order formulas>.

One quantified variable with a <quantifier-free formula> as matrix does not suffice. Let $M$ be an infinite edgeless <simple graph>, and let $N$ add two new <vertices> joined to each other and to no old <vertex>. Every one-variable <quantifier-free formula> over a finite parameter tuple from $M$ realized by a new <vertex> is realized by an old <vertex> outside that tuple. Nevertheless $N$ satisfies $\exists x\exists y\,E(x,y)$ and $M$ does not. Iteration of one-variable reflection fails because the remaining existential matrix need not be a <quantifier-free formula>.