I want a counter-example of o-minimal structure but do not admit elimination of quantifiers, we know that the inverse is true as (R,<,+,×,0,1) Tarski's theorem
2026-03-25 12:51:56.1774443116
Counter-example of o-minimal structure but do not admit elimination of quantifiers
172 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in FIRST-ORDER-LOGIC
- Proving the schema of separation from replacement
- Find the truth value of... empty set?
- Exchanging RAA with double negation: is this valid?
- Translate into first order logic: "$a, b, c$ are the lengths of the sides of a triangle"
- Primitive recursive functions of bounded sum
- Show formula which does not have quantifier elimination in theory of infinite equivalence relations.
- Logical Connectives and Quantifiers
- Is this proof correct? (Proof Theory)
- Is there only a finite number of non-equivalent formulas in the predicate logic?
- How to build a list of all the wfs (well-formed sentences)?
Related Questions in MODEL-THEORY
- What is the definition of 'constructible group'?
- Translate into first order logic: "$a, b, c$ are the lengths of the sides of a triangle"
- Existence of indiscernible set in model equivalent to another indiscernible set
- A ring embeds in a field iff every finitely generated sub-ring does it
- Graph with a vertex of infinite degree elementary equiv. with a graph with vertices of arbitrarily large finite degree
- What would be the function to make a formula false?
- Sufficient condition for isomorphism of $L$-structures when $L$ is relational
- Show that PA can prove the pigeon-hole principle
- Decidability and "truth value"
- Prove or disprove: $\exists x \forall y \,\,\varphi \models \forall y \exists x \,\ \varphi$
Related Questions in QUANTIFIER-ELIMINATION
- How quantifier elimination works
- Proof concerning quantifier elimination and substructures
- Show that the theory of $ (\mathbb{Z}, s)$ has quantifier elimination.
- Complete theory with quantifier elimination has finite boolean algebra
- Quantificational formatting and going from using logic with words, to using it for math proofs
- How much arithmetic is required to formalize quantifier elimination in Presburger arithmetic?
- If $T$ admits quantifier elimination in $\mathcal{L}$, does it admit quantifier elimination in $\mathcal{L}(c)$?
- Why is quantifier elimination desirable for a given theory?
- Exercise 3.4.3 in David Marker's "Model Theory"
- Quantifier elimination exercise
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The classic example is $\mathbb{R}_{\text{exp}} = (\mathbb{R};<,+,-,\times,0,1,e^x)$. Wilkie showed that the complete theory of this structure is o-minimal and model complete, but does not admit quantifier elimination. Formulas of the form $\exists \overline{y}\,(f(\overline{x},\overline{y},e^{\overline{x}},e^{\overline{y}}) = 0)$, where $f$ is a polynomial with integer coefficients, are typically not equivalent to quantifier-free formulas. See Wilkie's Theorem on Wikipedia and the references linked there for more information.
This example, while natural, is not so elementary. Much more trivially, we can expand the real field by new relation symbols which are definable with parameters in $\mathbb{R}$, and hence do not break o-minimality, but which do break quantifier elimination.
For example, consider the structure $(\mathbb{R};<,+,-,\times,0,1,P)$, where $P$ is a binary relation which holds only of the single point $(\alpha,\beta)$, where $\alpha$ and $\beta$ are algebraically independent transcendental real numbers. Since $P$ is definable with parameters in the real field (by $x = \alpha\land y = \beta$), any formula with parameters in the expanded language is equivalent to a formula with parameters in the field language, so the expanded structure is o-minimal.
Now I claim that the formula $\exists y\,P(x,y)$, which defines the singleton $\{\alpha\}$, is not equivalent to any quantifier-free formula $\theta(x)$. Note that any atomic formula in a single variable $x$ which uses the relation symbol $P$ has the form $P(t(x),t'(x))$, where $t$ and $t'$ are terms in the language of fields (i.e., polynomials with integer coefficients). Since $\alpha$ and $\beta$ are algebraically independent and transcendental, there is no real number $\gamma$ and terms $t$ and $t'$ such that $t(\gamma) = \alpha$ and $t'(\gamma) = \beta$. Thus every atomic formula of the form $P(t(x),t'(x))$ defines the empty set in $\mathbb{R}$. So every quantifier-free formula in the single variable $x$ in the expanded language is equivalent to a quantifier-free formula in the language of ordered fields, by replacing instances of $P(t(x),t'(x))$ by $x\neq x$. Finally, note that since $\alpha$ is transcendental, the set $\{\alpha\}$ is not definable by a quantifier-free formula in the language of ordered fields (the definable elements in $\mathbb{R}$ are exactly the algebraic real numbers $\overline{\mathbb{Q}}\cap \mathbb{R}$).