Given some function involving two variables, $\mathit p(x,y)$, is the formula $$\mathit \exists!x\exists yp(x,y)$$ equivalent to $$\mathit\exists y\exists!xp(x,y)$$ I have tried writing out the formal definition for the unique existential quantifier, but I get stuck simplifying the statement when the unique quantifier is first. I have also tried giving $\mathit p(x,y)$ some meaning and talking through it, but I can't decide if they mean the same thing. Any help is appreciated!
2026-03-28 09:43:39.1774691019
Does the unique existential quantifier commute with the existential quantifier?
1.5k 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 PROPOSITIONAL-CALCULUS
- Help with Propositional Logic Proof
- Can we use the principle of Explosion to justify the definition of implication being True when the antecedent is False?
- Simplify $(P \wedge Q \wedge R)\vee(\neg P\wedge Q\wedge\neg R)\vee(\neg P\wedge\neg Q\wedge R)\vee(\neg P \wedge\neg Q\wedge\neg R)$
- Alternative theories regarding the differences between the material conditional and the indicative conditionals used in natural language?
- Translations into logical notation
- Is the negation of $(a\wedge\neg b) \to c = a \wedge\neg b \wedge\neg c$?
- I am kind of lost in what do I do from here in Propositional Logic Identities. Please help
- Boolean Functional completeness of 5 operator set in propositional logic
- Variables, Quantifiers, and Logic
- Comparison Propositional Logic
Related Questions in PREDICATE-LOGIC
- Find the truth value of... empty set?
- What does Kx mean in this equation? [in Carnap or Russell and Whitehead's logical notation]
- Exchanging RAA with double negation: is this valid?
- Logical Connectives and Quantifiers
- Is this proof correct? (Proof Theory)
- Is there only a finite number of non-equivalent formulas in the predicate logic?
- Are Proofs of Dependent Pair Types Equivalent to Finding an Inverse Function?
- How to build a list of all the wfs (well-formed sentences)?
- Translations into logical notation
- What would be the function to make a formula false?
Related Questions in QUANTIFIERS
- Show formula which does not have quantifier elimination in theory of infinite equivalence relations.
- Prove or disprove: $\exists x \forall y \,\,\varphi \models \forall y \exists x \,\ \varphi$
- Variables, Quantifiers, and Logic
- Express least and greatest fixed point using predicate and quantifiers
- Nested Quantifiers - Excluding Self
- Logical Equivalences Involving Quantifiers
- Translating Propositional Functions
- Valid Set builder notations for simple set.
- Explanation about quantifier sequence ∀x∃y and ∃y∀x
- Contrapositive of a quantified statement
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?
No, they do not commute.
Consider for example the nonnegative reals as a linear order. Then $$\exists x\exists !y(y\le x)$$ is true (take $x=0$), but $$\exists!y \exists x(y\le x)$$ is false since for every $y$ there is some $x$ with $y\le x$.
This becomes less surprising when we "unpack" $\exists!$. There are a few ways to do this, but I think the simplest is to view "$\exists !x\varphi(x,...)$" as an abbreviation for "$\exists x\forall z(\varphi(z,...)\leftrightarrow x=z)$." Then we have:
"$\exists x\exists!y\varphi(x,y)$" is an abbreviation for $$\exists x\exists y\forall z(\varphi(x,z)\leftrightarrow y=z),$$
while "$\exists!y\exists x\varphi(x,y)$" is an abbreviation for $$\exists y\forall z[(\exists x\varphi(x,z))\leftrightarrow y=z].$$
This has a clear instance of swapping $\forall$ and $\exists$ (in fact, it's even messier than that - unpack "$\leftrightarrow$" ...), so we should expect them to be inequivalent in general.
(There are of course other ways to unpack "$\exists!$," but they'll all yield the same general picture: despite the symbol suggesting only existentiality, it's hiding a very important universal quantifier, and so the usual dangers of $\forall/\exists$-switching carry over to $\exists!/\exists$-switching.)