Intuitionistic Logic

Semantics

Reading preferences

Optional display controls need JavaScript. All reading content and navigation work without it.

Source file content/intuitionistic-logic/semantics/semantics.tex

Editorial

This chapter collects definitions for semantics for intuitionistic logic. So far only Kripke and topological semantics are covered. There are no examples yet, either of how models make formulas true or of proofs that formulas are valid.

Source file content/intuitionistic-logic/semantics/introduction.tex

Introduction

No logic is satisfactorily described without a semantics, and intuitionistic logic is no exception. Whereas for classical logic, the semantics based on valuations is canonical, there are several competing semantics for intuitionistic logic. None of them are completely satisfactory in the sense that they give an intuitionistically acceptable account of the meanings of the connectives.

The semantics based on relational models, similar to the semantics for modal logics, is perhaps the most popular one. In this semantics, propositional variables are assigned to worlds, and these worlds are related by an accessibility relation. That relation is always a partial order, i.e., it is reflexive, antisymmetric, and transitive.

Intuitively, you might think of these worlds as states of knowledge or “evidentiary situations.” A state ww'source is accessible from wwsource iff, for all we know, ww'source is a possible (future) state of knowledge, i.e., one that is compatible with what's known at wwsource. Once a proposition is known, it can't become un-known, i.e., whenever A!Asource is known at wwsource and RwwRww'source, A!Asource is known at ww'source as well. So “knowledge” is monotonic with respect to the accessibility relation.

If we define “A!Asource is known” as in epistemic logic as “true in all epistemic alternatives,” then AB!A \land !Bsource is known at wwsource if in all epistemic alternatives, both A!Asource and B!Bsource are known. But since knowledge is monotonic and RRsource is reflexive, that means that AB!A \land !Bsource is known at wwsource iff A!Asource and B!Bsource are known at wwsource. For the same reason, AB!A \lor !Bsource is known at wwsource iff at least one of them is known. So for \landsource and \lorsource, the truth conditions of the connectives coincide with those in classical logic.

The truth conditions for the conditional, however, differ from classical logic. AB!A \lif !Bsource is known at wwsource iff at no ww'source with RwwRww'source, A!Asource is known without B!Bsource also being known. This is not the same as the condition that A!Asource is unknown or B!Bsource is known at wwsource. For if we know neither A!Asource nor B!Bsource at wwsource, there might be a future epistemic state ww'source with RwwRww'source such that at ww'source, A!Asource is known without also coming to know B!Bsource.

We know ¬A\lnot !Asource only if there is no possible future epistemic state in which we know A!Asource. Here the idea is that if A!Asource were knowable, then in some possible future epistemic state A!Asource becomes known. Since we can't know \lfalsesource, in that future epistemic state, we would know A!Asource but not know \lfalsesource.

On this interpretation the principle of excluded middle fails. For there are some A!Asource which we don't yet know, but which we might come to know. For such a formula A!Asource, both A!Asource and ¬A\lnot !Asource are unknown, so A¬A!A \lor \lnot !Asource is not known. But we do know, e.g., that ¬(A¬A)\lnot(!A \land \lnot !A)source. For no future state in which we know both A!Asource and ¬A\lnot !Asource is possible, and we know this independently of whether or not we know A!Asource or ¬A\lnot !Asource.

Relational models are not the only available semantics for intuitionistic logic. The topological semantics is another: here propositions are interpreted as open sets in a topological space, and the connectives are interpreted as operations on these sets (e.g., \landsource corresponds to intersection).

Source file content/intuitionistic-logic/semantics/relational-models.tex

relational model

In order to give a precise semantics for intuitionistic propositional logic, we have to give a definition of what counts as a model relative to which we can evaluate formulas. On the basis of such a definition it is then also possible to define semantics notions such as validity and entailment. One such semantics is given by relational models.

Definition of an intuitionistic relational model

A relational model for intuitionistic propositional logic is a triple M=W,R,V\mModel{M} = \tuple{W, R, V}source, where

  1. WWsource is a non-empty set,

  2. RRsource is a partial order (i.e., a reflexive, antisymmetric, and transitive binary relation) on WWsource, and

  3. VVsource is a function assigning to each propositional variable ppsource a subset of WWsource, such that

  4. VVsource is monotone with respect to RRsource, i.e., if wV(p)w \in V(p)source and RwwRww'source, then wV(p)w' \in V(p)source.

Inductive definition of truth at a world

We define the notion of A!Asource being true at wwsource in M\mModel{M}source, MA[w]\mSat{M}{!A}[w]source, inductively as follows:

  1. Case: Ap!A \ident psource

    MA[w]\mSat{M}{\indfrm}[w]source iff wV(p)w \in V(p)source.

  2. Case: A!A \ident \lfalsesource

    not MA[w]\mSat{M}{\indfrm}[w]source.

  3. Case: A¬B!A \ident \lnot !Bsource

    MA[w]\mSat{M}{\indfrm}[w]source iff for no ww'source such that RwwRww'source, MB[w]\mSat{M}{!B}[w']source.

  4. Case: ABC!A \ident !B \land !Csource

    MA[w]\mSat{M}{\indfrm}[w]source iff MB[w]\mSat{M}{!B}[w]source and MC[w]\mSat{M}{!C}[w]source.

  5. Case: ABC!A \ident !B \lor !Csource

    MA[w]\mSat{M}{\indfrm}[w]source iff MB[w]\mSat{M}{!B}[w]source or MC[w]\mSat{M}{!C}[w]source (or both).

  6. Case: ABC!A \ident !B \lif !Csource

    MA[w]\mSat{M}{\indfrm}[w]source iff for every ww'source such that RwwRww'source, not MB[w]\mSat{M}{!B}[w']source or MC[w]\mSat{M}{!C}[w']source (or both).

We write MA[w]\mSat/{M}{!A}[w]source if not MA[w]\mSat{M}{!A}[w]source. If Γ\Gammasource is a set of formulas, MΓ[w]\mSat{M}{\Gamma}[w]source means MB[w]\mSat{M}{!B}[w]source for all BΓ!B \in \Gammasource.

Exercise relating negation to a conditional

Show that according to the definition of truth at a world, M¬A[w]\mSat{M}{\lnot !A}[w]source iff MA[w]\mSat{M}{!A \lif \lfalse}[w]source.

Proposition that truth is monotone

Truth at worlds is monotonic with respect to RRsource, i.e., if MA[w]\mSat{M}{!A}[w]source and RwwRww'source, then MA[w]\mSat{M}{!A}[w']source.

Proof

Exercise.

Exercise proving truth monotonicity

Prove the proposition that truth at worlds is monotone.

Source file content/intuitionistic-logic/semantics/semantic-notions.tex

Semantic Notions

Definition of global truth, validity, and entailment

We say A!Asource is true in the model M=W,R,V\mModel{M} = \tuple{W,R,V}source, MA\mSat{M}{!A}source, iff MA[w]\mSat{M}{!A}[w]source for all wWw \in Wsource. A!Asource is valid, A\Entails !Asource, iff it is true in all models. We say a set of formulas Γ\Gammasource entails A!Asource, ΓA\Gamma \Entails !Asource, iff for every model M\mModel{M}source and every wwsource such that MΓ[w]\mSat{M}{\Gamma}[w]source, MA[w]\mSat{M}{!A}[w]source.

Two consequences of entailment

  1. If MΓ[w]\mSat{M}{\Gamma}[w]source and ΓA\Gamma \Entails !Asource, then MA[w]\mSat{M}{!A}[w]source.

  2. If MΓ\mSat{M}{\Gamma}source and ΓA\Gamma \Entails !Asource, then MA\mSat{M}{!A}source.

Proof

  1. Suppose MΓ\mSat{M}{\Gamma}source. Since ΓA\Gamma \Entails !Asource, we know that if MΓ[w]\mSat{M}{\Gamma}[w]source, then MA[w]\mSat{M}{!A}[w]source. Since MΓ[u]\mSat{M}{\Gamma}[u]source for all every uWu \in Wsource, MΓ[w]\mSat{M}{\Gamma}[w]source. Hence MA[w]\mSat{M}{!A}[w]source.

  2. Follows immediately from the first part of the proposition relating satisfaction and entailment.

Definition of a model restricted to a world

Suppose M\mModel{M}source is a relational model and wWw \in Wsource. The restriction Mw=Ww,Rw,Vw\mModel{M}_w=\tuple{W_w, R_w, V_w}source of M\mModel{M}source to wwsource is given by:

Ww={uW:Rwu},Rw=R(Ww)2, andVw(p)=V(p)Ww.W_w & = \Setabs{u \in W}{Rwu},\\ R_w & = R \cap (W_w)^2, \text{ and}\\ V_w(p) & = V(p) \cap W_w.source

Proposition characterizing restriction

MA[w]\mSat{M}{!A}[w]source iff MwA\mSat{M_w}{!A}source.

Exercise proving the restriction proposition

Prove the proposition characterizing restriction to a world.

Proposition deriving local entailment from global model truth

Suppose for every model M\mModel{M}source such that MΓ\mSat{M}{\Gamma}source, MA\mSat{M}{!A}source. Then ΓA\Gamma \Entails !Asource.

Proof

Suppose that MΓ[w]\mSat{M}{\Gamma}[w]source. By the the proposition characterizing restriction to a world applied to every BΓ!B \in \Gammasource, we have MwΓ\mSat{M_w}{\Gamma}source. By the assumption, we have MwA\mSat{M_w}{!A}source. By the proposition characterizing restriction to a world again, we get MA[w]\mSat{M}{!A}[w]source.

Source file content/intuitionistic-logic/semantics/topological-semantics.tex

Topological Semantics

Another way to provide a semantics for intuitionistic logic is using the mathematical concept of a topology.

Definition of a topology

Let XXsource be a set. A topology on XXsource is a set O(X)\Top{O} \subseteq \Pow{X}source that satisfies the properties below. The elements of O\Top{O}source are called the open sets of the topology. The set XXsource together with O\Top{O}source is called a topological space.

  1. The empty set and the entire space are open: \emptysetsource, XOX \in \Top{O}source.

  2. Open sets are closed under finite intersections: if UUsource, VOV \in \Top{O}source then UVOU \cap V \in \Top{O}source

  3. Open sets are closed under arbitrary unions: if UiOU_i \in \Top{O}source for all iIi \in Isource, then {Ui:iI}O\bigcup \Setabs{U_i}{i \in I} \in \Top{O}source.

We may write XXsource for a topology if the collection of open sets can be inferred from the context; note that, still, only after XXsource is endowed with open sets can it be called a topology.

Definition of a topological model and its propositions

A topological model of intuitionistic propositional logic is a triple X=X,O,V\mModel{X} = \tuple{X, \Top{O}, V}source where O\Top{O}source is a topology on XXsource and VVsource is a function assigning an open set in O\Top{O}source to each propositional variable.

Given a topological model X\mModel{X}source, we can define AX\Prop{X}{!A}source inductively as follows:

  1. X=\Prop{X}{\lfalse} = \emptysetsource

  2. pX=V(p)\Prop{X}{p} = V(p)source

  3. ABX=AXBX\Prop{X}{!A \land !B} = \Prop{X}{!A} \cap \Prop{X}{!B}source

  4. ABX=AXBX\Prop{X}{!A \lor !B} = \Prop{X}{!A} \cup \Prop{X}{!B}source

  5. ABX=Int((XAX)BX)\Prop{X}{!A \lif !B} = \Interior{(X \setminus \Prop{X}{!A}) \cup \Prop{X}{!B}}source

Here, Int(V)\Interior{V}source is the function that maps a set VXV \subseteq Xsource to its interior, that is, the union of all open sets it contains. In other words,

Int(V)={U:UV and UO}.\Interior{V} = \bigcup \Setabs{U}{U \subseteq V \text{ and } U \in \Top{O}}.source

Note that the interior of any set is always open, since it is a union of open sets. Thus, AX\Prop{X}{!A}source is always an open set.

Although topological semantics is highly abstract, there are ways to think about it that might motivate it. Suppose that the elements, or “points,” of XXsource are points at which statements can be evaluated. The set of all points where A!Asource is true is the proposition expressed by A!Asource. Not every set of points is a potential proposition; only the elements of O\Top{O}source are. AB!A \Entails !Bsource iff B!Bsource is true at every point at which A!Asource is true, i.e., AXBX\Prop{X}{!A} \subseteq \Prop{X}{!B}source, for all XXsource. The absurd statement \lfalsesource is never true, so X=\Prop{X}{\lfalse} = \emptysetsource.

How must the propositions expressed by BC!B \land !Csource, BC!B \lor !Csource, and BC!B \lif !Csource be related to those expressed by B!Bsource and C!Csource for the intuitionistically valid laws to hold, i.e., so that AB!A \Proves !Bsource iff AXBX\Prop{X}{!A} \subset \Prop{X}{!B}source? We require A\lfalse \Proves !Asource for any A!Asource, which is satisfied because U\emptyset \subseteq Usource for all UUsource. Since BCB!B \land !C \Proves !Bsource, we require that BCXBX\Prop{X}{!B \land !C} \subseteq \Prop{X}{!B}source, and similarly BCXCX\Prop{X}{!B \land !C} \subseteq \Prop{X}{!C}source. The largest set satisfying WUW \subseteq Usource and WVW \subseteq Vsource is UVU \cap Vsource. Conversely, BBC!B \Proves !B \lor !Csource and CBC!C \Proves !B \lor !Csource, and so we require that BXBCX\Prop{X}{!B} \subseteq \Prop{X}{!B \lor !C}source and CXBCX\Prop{X}{!C} \subseteq \Prop{X}{!B \lor !C}source. The smallest set WWsource such that UWU \subseteq Wsource and VWV \subseteq Wsource is UVU \cup Vsource.

The definition for \lifsource is tricky: AB!A \lif !Bsource expresses the weakest proposition that, combined with A!Asource, entails B!Bsource. That AB!A \lif !Bsource combined with A!Asource entails B!Bsource is clear from (AB)AB(!A \lif !B) \land !A \Proves !Bsource. So ABX\Prop{X}{!A \lif !B}source should be the greatest open set such that ABXAXBX\Prop{X}{!A \lif !B} \cap \Prop{X}{!A} \subset \Prop{X}{!B}source, leading to our definition.

Source disclosures