7
$\begingroup$

This extracts a simple case from a cross-post at cs.SE.

Here is a fact about Intuitionistic Propositional Logic:

A formula $p$ is equivalent to a formula of the form $q \lor \neg q$ if and only if $\neg p$ is false.

This can be reformulated in algebraic semantics:

For any Heyting algebra $H$ and any element $p\in H$, there exists a $q\in H$ with $p=q\lor\neg q$ if and only if $\neg p=\bot$ (the bottom element of $H$).

This eliminates an existential quantifier, in the sense of finding an equivalent condition on $p$ which does not involve any "there exists" statement.

This leads to the question that interests me:

Given a pair of elements $p,p'$ in a Heyting algebra $H$, when can they be written as $p=q\lor\neg q$ and $p'=q'\lor\neg q'$ with $q\land q'=\bot$?

Is it possible to eliminate existential quantifiers here too?

Much later -- update: a still simpler similar question which I also do not know anything about.

Can one eliminate the existential quantifier from the following formula (in the language of Heyting algebras): $$ \exists x\ p = (q\land x)\lor\neg(q\land x) $$

$\endgroup$
12
  • 2
    $\begingroup$ Yes... but I wonder if it's possible. An example I believe to be revealing is this: $p = r\vee \neg r$ and $p'= \neg r\vee \neg\neg r$. We can then take $q=r, q'=\neg r$. Still, neither $p$ or $p'$ is a theorem in IPL, so that particular simplification that I had in mind does not always hold... perhaps some other simplification is possible. $\endgroup$ Commented Oct 29, 2020 at 14:29
  • 1
    $\begingroup$ @MattF. I've highlighted the question, and also tried to make it more precise, is it better now? $\endgroup$ Commented Oct 29, 2020 at 15:24
  • 2
    $\begingroup$ @FrankaWaaldijk Great observation! This also relates to another instance of the same question which I decided to omit here: whether one can characterize those $p$ of the form $\neg r\lor\neg\neg r$. This is definitely more restrictive than just $\neg\neg p$: for example, in the duality semantics $\neg\neg p$ means that the corresponding up-set of the dual space contains the whole maximum of the dual space, while if $p$ is $\neg r\lor\neg\neg r$ then in addition this up-set must contain all those points which see unique maximal point. $\endgroup$ Commented Oct 29, 2020 at 15:35
  • 1
    $\begingroup$ @FrankaWaaldijk Accordingly, here is an example when neither $p$ nor $p'$ has form $\neg r\lor\neg\neg r$. Consider the algebra of up-sets of the poset $x<X>0<X'>x'$, and let $p=\{X,X',x'\}$, $p'=\{x,X,X'\}$. They satisfy the requirement with $q=\{X\}$ and $q'=\{X'\}$. However the only two up-sets of the form $\neg r\lor\neg\neg r$ are the whole poset and the whole poset except $0$. $\endgroup$ Commented Oct 29, 2020 at 17:17
  • 2
    $\begingroup$ @MattF. Tried another title, please have a look $\endgroup$ Commented Oct 30, 2020 at 17:17

0

You must log in to answer this question.

Browse other questions tagged .