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 source is accessible from source iff, for all we know, source is a possible (future) state of knowledge, i.e., one that is compatible with what's known at source. Once a proposition is known, it can't become un-known, i.e., whenever source is known at source and source, source is known at source as well. So “knowledge” is monotonic with respect to the accessibility relation.
If we define “source is known” as in epistemic logic as “true in all epistemic alternatives,” then source is known at source if in all epistemic alternatives, both source and source are known. But since knowledge is monotonic and source is reflexive, that means that source is known at source iff source and source are known at source. For the same reason, source is known at source iff at least one of them is known. So for source and source, the truth conditions of the connectives coincide with those in classical logic.
The truth conditions for the conditional, however, differ from classical logic. source is known at source iff at no source with source, source is known without source also being known. This is not the same as the condition that source is unknown or source is known at source. For if we know neither source nor source at source, there might be a future epistemic state source with source such that at source, source is known without also coming to know source.
We know source only if there is no possible future epistemic state in which we know source. Here the idea is that if source were knowable, then in some possible future epistemic state source becomes known. Since we can't know source, in that future epistemic state, we would know source but not know source.
On this interpretation the principle of excluded middle fails. For there are some source which we don't yet know, but which we might come to know. For such a formula source, both source and source are unknown, so source is not known. But we do know, e.g., that source. For no future state in which we know both source and source is possible, and we know this independently of whether or not we know source or source.
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., source 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 source, where
source is a non-empty set,
source is a partial order (i.e., a reflexive, antisymmetric, and transitive binary relation) on source, and
source is a function assigning to each propositional variable source a subset of source, such that
source is monotone with respect to source, i.e., if source and source, then source.
Inductive definition of truth at a world
We define the notion of source being true at source in source, source, inductively as follows:
Case: source
Case: source
not source.
Case: source
Case: source
Case: source
Case: source
source iff for every source such that source, not source or source (or both).
We write source if not source. If source is a set of formulas, source means source for all source.
Exercise relating negation to a conditional
Show that according to the definition of truth at a world, source iff source.
Proposition that truth is monotone
Truth at worlds is monotonic with respect to source, i.e., if source and source, then source.
Proof
Exercise.
Exercise proving truth monotonicity
Source file content/intuitionistic-logic/semantics/semantic-notions.tex
Semantic Notions
Definition of global truth, validity, and entailment
We say source is true in the model source, source, iff source for all source. source is valid, source, iff it is true in all models. We say a set of formulas source entails source, source, iff for every model source and every source such that source, source.
Two consequences of entailment
Proof
Definition of a model restricted to a world
Suppose source is a relational model and source. The restriction source of source to source is given by:
Proposition characterizing restriction
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 source such that source, source. Then source.
Proof
Suppose that source. By the the proposition characterizing restriction to a world applied to every source, we have source. By the assumption, we have source. By the proposition characterizing restriction to a world again, we get 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 source be a set. A topology on source is a set source that satisfies the properties below. The elements of source are called the open sets of the topology. The set source together with source is called a topological space.
We may write source for a topology if the collection of open sets can be inferred from the context; note that, still, only after source 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 source where source is a topology on source and source is a function assigning an open set in source to each propositional variable.
Given a topological model source, we can define source inductively as follows:
Here, source is the function that maps a set source to its interior, that is, the union of all open sets it contains. In other words,
Note that the interior of any set is always open, since it is a union of open sets. Thus, 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 source are points at which statements can be evaluated. The set of all points where source is true is the proposition expressed by source. Not every set of points is a potential proposition; only the elements of source are. source iff source is true at every point at which source is true, i.e., source, for all source. The absurd statement source is never true, so source.
How must the propositions expressed by source, source, and source be related to those expressed by source and source for the intuitionistically valid laws to hold, i.e., so that source iff source? We require source for any source, which is satisfied because source for all source. Since source, we require that source, and similarly source. The largest set satisfying source and source is source. Conversely, source and source, and so we require that source and source. The smallest set source such that source and source is source.
The definition for source is tricky: source expresses the weakest proposition that, combined with source, entails source. That source combined with source entails source is clear from source. So source should be the greatest open set such that source, leading to our definition.
Source disclosures
- TR060-SAR-001: Source caveat. The first numbered proof paragraph assumes global truth of Gamma and concludes truth of A at an arbitrary world, while the proposition's first item has a local premise at one world. The next paragraph says the second item follows from the first. The printed numbering and argument are retained without silently swapping the paragraphs. source
- TR060-SAR-002: Source caveat. The phrase for all every is retained as a source wording error; the mathematical formula u belongs to W is unchanged. source
- TR060-SAR-003: Source caveat. These two displayed semantic conditions use the strict-subset symbol, whereas the surrounding order conditions predominantly use subset-or-equal. The edition preserves and speaks strict subset at the two printed occurrences. source