I find it hard to understand the following formula in intuitionistic logic, where $P\neq\perp$ and $P\not\leftrightarrow(\neg\neg\exists xQ(x)\rightarrow\exists xQ(x))$: $$P\rightarrow(\neg\neg\exists xQ(x)\rightarrow\exists xQ(x))\quad\quad(*)$$ Intuitively, it says that from $P$, infer $\neg\neg\exists xQ(x)\rightarrow\exists Q(x)$. Clearly, the consequent $\neg\neg\exists xQ(x)\rightarrow\exists xQ(x)$ does not hold in intuitionistic logic. So, my question is under what conditions, this formula is true. The only way I can come up with is that $(*)$ holds if $P\rightarrow\exists xQ(x)$. But is that the only way to derive $(*)$? If that's the only way, can we infer $P\rightarrow\exists xQ(x)$ from $(*)$? This looks quite odd. So, is there any other way to derive $(*)$ and what can we infer from $(*)$? Thanks in advance!
2026-03-26 18:56:50.1774551410
A question about intuitionistic logic
74 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 INTUITIONISTIC-LOGIC
- Are Proofs of Dependent Pair Types Equivalent to Finding an Inverse Function?
- Prove the undecidability of a formula
- Semantics for minimal logic
- Is minimal logic equivalent to intuitionistic?
- How do set theories base on Intuitionistic Logic deal with ordinals?
- Why is intuitionistic modelling called forcing?
- Attempt at constructive proof of compactness of [0,1], does this use LEM? Does a constructive proof exist?
- Is there a theorem that can easily be proved to be non intuitionistic?
- Interpretation of implication in intuitionistic logic
- $\mathbb Q$ topological semantics for intuitionistic propositional logic
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?
We definitely do not need $P \to \exists x Q(x)$ for this. For example, we could have that $P$ is $R \wedge (\neg \neg \exists x Q(x) \to \exists x Q(x))$, where $R$ is some new propositional symbol. So $(*)$ trivially holds. Then it is easy to see that $P \to \exists x Q(x)$ cannot be derived from $(*)$. Just consider a model where $R$ is true and $\forall x \neg Q(x)$ holds.
I do not think we can say much more in general than that. Because in the above example, once we would also add the axiom that $R$ is always true, we just get that $P$ is equivalent to $\neg \neg \exists x Q(x) \to \exists x Q(x)$ and $R$ has no real function. So no information is gained from $(*)$.