I'm trying to follow a proof in a logic text and it seems like the author used universal instantiation twice to reach the needed result. I was under the impression that you could only use UI one time in a proof.
2026-03-26 02:53:59.1774493639
Can universal instantiation be used more than once?
774 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
Related Questions in FORMAL-PROOFS
- What is a gross-looking formal axiomatic proof for a relatively simple proposition?
- Limit of $f(x) = x \bmod k$
- Need help with formalising proofs in Calculus. Convergent and Divergent series:
- Proving either or statements (in group theory)
- Prove a floor function is onto/surjective
- Countability of Fibonacci series
- Can the natural deduction system prove $P \iff ¬P$ to show that it's a contradiction?
- How would I show that X is equivalent to ((¬X ↔ X ) ∨ X )?
- Variations in the Statement of Strong Induction: Equivalent or Different?
- Is this proof correct? (natural deduction)
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?
Nothing prevents us to use universal instantiation (UI) more than once in a proof.
Consider the formula in the language of formal arithmetics :
where $S(x)$ is the "successor" function.
We can clearly instantiate it with $0$, to get :
which is true when $y$ get the value $1$; and again with :
which is true when $y$ get the value $2$.
Added
You can see Peter Smith's answer to this post.
In order to prove :
we have to proceed this way :
(i) $\forall x \forall yR(x,y)$ --- assumed
(ii) $\forall yR(x,y)$ --- by Universal Instantiation
(iii) $R(x,x)$ --- by UI
(iv) $\forall x R(x,x)$ --- by Universal Generalization, $x$ is not free in $\Gamma$, where $\Gamma = \{ \forall x \forall yR(x,y) \}$.