#### May 30, 2015

In yesterday’s Logic Seminar, Tomasz Kowalski introduced some lovely results about analytic cut and interpolation in sequent systems for bi-intuitionistic logic. After the seminar, Lloyd Humberstone, Dave Ripley, Tomasz and I got talking about various features of bi-intuitionistic logic, some of which should be more well known than they are … so I may as well post them here. Read on, if you’re into non-classical logic, algebras and frames.

The conditional in intuitionistic logic satisfies the lovely residuation principle: $p\land q \le r \quad \Leftrightarrow \quad p\land q\supset r$ where $$\le$$ is entailment—the underlying lattice ordering on propositions–and $$\land$$ is conjunction. Bi-intuitionistic logic is found by adding to the vocabulary a two-place connective (dual to the conditional) of subtraction, satisfying the dual residuation principle: $p\le q\lor r \quad \Leftrightarrow \quad p-q \le r$ This has lots of lovely (and strange) properties. If $$p\supset 0$$ defines the strong intuitionist negation (which is a contrary but not sub-contrary forming operator) then $$1-p$$ forms a weak dual negation (which is a sub-contrary but not contrary forming operator). It is a conservative addition to the propositional inuitionist logic. (All complete and completely distributive lattices can be equipped with a subtraction operator, defined by setting $$p-q$$ to be $$\bigwedge\{r:p\le q\lor r\}$$, and all Heyting lattices can be embedded into complete and completly distributive Heyting lattices.) It is not a conservative extension of first-order intuitionist logic. (With subtraction, you can show that $$\forall x(Fx\lor Gx)$$ entails $$\forall x Fx\lor \exists xGx$$, which is underivable in intuitionist logic.)

The result I thought should be more well known is that the dual intuitionist substraction can be defined if you add a de Morgan negation to intiutionst logic, and this addition is also conservative in the propositional case. A de Morgan negation is an operator $$\sim$$ such that $${\mathord\sim}{\mathord\sim}p=p$$ and $$p\le q$$ only if $${\mathord\sim}q\le {\mathord\sim}p$$. It’s called a “de Morgan negation” because in a lattice, these conditions mean that all four de Morgan laws hold connecting $${\mathord\sim}$$, $$\land$$ and $$\lor$$.

Lemma 9.35 in my substructural logic book (An Introduction to Substructural Logics) is a construction that embeds a lattice into one including a de Morgan negation. (This construction—like many results in this field—uses techniques due to Bob Meyer.) The construction is straightforward. It doesn’t quite work in the Heyting lattice case, but it’s very close to working. That construction takes the original lattice, adds a top element (if not already present) and adds an inverted copy of the structure below the original structure. This construction doesn’t preserve the bottom element (that’s no good, as we can express this in intuitionistic logic, with $$p\land\neg p$$), and it’s fiddly to see how you might do that using algebraic surgery. Perhaps you can, but I worry about getting the cases correct.

However, it suggest a way to do it relatively straightforwardly, using Kripke frames.

It’s well known that in frame semantics, a de Morgan negation can be modelled using a Routley star operation. A unary function on points in the frame such that $$x^{**}=x$$ and if $$x\sqsubseteq y$$ then $$y^{*}\sqsubseteq x^{*}$$. Then we define $x\Vdash {\mathord\sim}A \quad \Leftrightarrow x^{*}\not\Vdash A$ and the result is a de Morgan negation. That’s fair enough. But there’s no way, in general, to take a Kripke frame for intuitionistic logic and slap a de Morgan negation onto it. Take the three-point tree on the set $$\{a,b,c\}$$ where $$a\sqsubset b$$ and $$a\sqsubset c$$. There aren’t enough candidates for $$b^{*}$$ and $$c^{*}$$. They need to be different and they need to be earlier than $$a^{*}$$ in the ordering, but there’s not enough objects in the frame to satisfy this. To do this, we need three objects $$\{e,f,g\}$$—somewhere–where $$f\sqsubset e$$ and $$g\sqsubset e$$, so we can let $$a^{*}=e$$, $$b^{*}=f$$ and $$c^{*}=g$$.

One way to do this to any Kripke model $$\langle P,\sqsubseteq,\vDash\rangle$$ is to add a new set $$P^{*}$$—an extra copy of $$P$$, so we operate on the disjoint union $$P\cup P^{*}$$. We define the operation $${*}$$ in the obvious way: if $$x$$ is in $$P$$, then its star is the copy $$x^{*}$$ in $$P^{*}$$. Define the ordering by allowing $$x^{*}\sqsubseteq y$$ but not $$y \sqsubseteq x^{*}$$ for each $$x,y$$ in $$P$$ (so each of the $$P^{*}$$ points come before the $$P$$ points) and setting $$x^{*} \sqsubseteq y^{*}$$ iff $$y \sqsubseteq x$$.

(In other words, we take a copy of our Kripke frame, invert it, and have all of those points come before each of the original points.)

The operation * is a Routley star on the structure, and it’s still a poset, so we have a Kripke frame. We can use * on the frame to define a de Morgan negation.

Given the original model $$\langle P,\sqsubseteq,\Vdash\rangle$$, extend the valuation to the new domain $$P \cup P^{*}$$ as required by heredity on frames. Any atom true at some point in $$P$$ is true at all points in $$P^{*}$$, but any atom not true anywhere in $$P$$ can remain not true everywhere in $$P^{*}$$. An easy induction shows that if formula is true at a point in $$P$$ in the original model iff it’s true at that point in the extended model. (The extension $$[\![p]\!]$$ of an atom in the new model is now closed upward under $$\sqsubseteq$$, and $$[\![p]\!]\cap P$$ remains the same as the extension of $$p$$ in the old model. Furthermore, since all evaluation conditions for intuitionist connectives look forward, the restriction of $$[\![A]\!]$$ (for any complex formula $$A$$) to $$P$$ is identical to the extension of $$[\![A]\!]$$ in the old model, by an induction on the construction of $$A$$.

This construction shows how to embed the new propositions between the bottom element and anything else in the original Heyting algebra.

A dual construction could add the elements in the Kripke frame after the original elements (and then everything gets embedded just below the top element), or they could be incomparable with the objects in original frame. But as Lloyd Humberstone pointed out to me, the dual construction is not conservative, because the evaluation of formulas on the original set $$P$$ now looks forward to more points, those in $$P^{*}$$, and this can change the truth of intuitionist formulas. For example, given a model consisting two points $$a,b$$ which are incomparable through $$\sqsubseteq$$, where we set $$a\Vdash p$$ but $$b\not\Vdash p$$, then if we add $$a^{*}$$ and $$b^{*}$$ to both occur after both $$a$$ and $$b$$ then we are in a quandry. Since $$p$$ is true at $$a$$, and since $$a\sqsubseteq a^{*}$$ we must have $$a^{*}\Vdash p$$. But then it follows that in the new model, $$b\not\Vdash \neg p$$, despite the fact that in the original model, $$b\Vdash\neg p$$. The addition does not preserve the logical structure of propositions on the original frame, so it cannot be used to demonstrate conservative extensions.

However, the construction where the new points are placed before the original points, or where they are alongside (and incomparable) have no such problems. So there are at least 2 different ways to take a Kripke model for intuitionistic logic and to embed it into a structure supporting a de Morgan negation, and thus allowing the de Morgan laws to interdefine the intuitionistic conditional and dual intuitionistic subtraction. This shows that intuitionistic propositional logic is conservatively extended by a de Morgan negation, and this de Morgan negation can be used to define the weird binary connective of subtraction—all without doing damage to the underlying propositional logic.

Thanks, Tomasz, for a fun logic seminar yesterday, and for reminding me of these results. After spending over seven years concentrating on proof theory, it feels comfortable to slip back into working with algebras and frames.

← Verbal Disputes in Oxford (Workshop Report #1) | News Archive | Another Day at the Office →