In order to solve this question, I think I need to swap the two closed variables. I tried applying Universal Elimination in order to open up the closed variable but I don't know what to do after I reach- p(x,y).
2026-03-28 22:13:42.1774736022
Given ∀x.∀y.p(x,y), use the Fitch System to prove ∀x.∀y.p(y,x)
659 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 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?
This is one of those cases where it is clearest to use a Fitch-style system where we have to use a syntactically differentiated class of symbols for parameters (rather than re-cycle the same symbols for both [bound] variables and [unbound] parameters). For example, this is neat and clear:
$ \def\fitch#1#2{\quad\begin{array}{|l}#1\\\hline#2\end{array}} \fitch{\forall x\forall yPxy} {\forall yPay\\ Pab\\ \forall yPyb\\ \forall x\forall yPyx} $
We instantiate the outer universal quantifier with a parameter at the second line, and then instantiate the quantifier at that line with a new parameter to get the third line. $a$ and then $b$ can be thought of as dummy names for arbitrarily chosen objects in the domain. Since they are arbitrary (don't appear in any assumption), we can then generalize (using any variable we like to form the universal quantifier) at the fourth line, and generalize again to get what we wanted at the fifth line. And so it goes.
If you use an (evil! ;) ND system that doesn't differentiate properly between bound variables and dummy names, then as Mauro says you'd need something that looks like
$ \def\fitch#1#2{\quad\begin{array}{|l}#1\\\hline#2\end{array}} \fitch{\forall x\forall yPxy} {\forall yPwy\\ Pwz\\ \forall yPyz\\ \forall x\forall yPyx} $
But to explain what that means, to explain what is going on here, you'll have to explain that $w$ and $z$ are playing a different role to the bound variables $x$ and $y$; and it is a good Fregean principle to use different styles of symbols for expressions playing different roles. That's why the first version of the proof, by those standards, counts as more logically perspicuous than the second version.