Intuitionistic logic

Short description: Various systems of symbolic logic

Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems of intuitionistic logic do not assume the law of the excluded middle and double negation elimination, which are fundamental inference rules in classical logic.

Formalized intuitionistic logic was originally developed by Arend Heyting to provide a formal basis for L. E. J. Brouwer's programme of intuitionism. From a proof-theoretic perspective, Heyting’s calculus is a restriction of classical logic in which the law of excluded middle and double negation elimination have been removed. Excluded middle and double negation elimination can still be proved for some propositions on a case by case basis, however, but do not hold universally as they do with classical logic. The standard explanation of intuitionistic logic is the BHK interpretation.

Several systems of semantics for intuitionistic logic have been studied. One of these semantics mirrors classical Boolean-valued semantics but uses Heyting algebras in place of Boolean algebras. Another semantics uses Kripke models. These, however, are technical means for studying Heyting’s deductive system rather than formalizations of Brouwer’s original informal semantic intuitions. Semantical systems claiming to capture such intuitions, due to offering meaningful concepts of “constructive truth” (rather than merely validity or provability), are Kurt Gödel’s dialectica interpretation, Stephen Cole Kleene’s realizability, Yurii Medvedev’s logic of finite problems, or Giorgi Japaridze’s computability logic. Yet such semantics persistently induce logics properly stronger than Heyting’s logic. Some authors have argued that this might be an indication of inadequacy of Heyting’s calculus itself, deeming the latter incomplete as a constructive logic.

Mathematical constructivism

In the semantics of classical logic, propositional formulae are assigned truth values from the two-element set [math]\displaystyle{ \{\top, \bot\} }[/math] ("true" and "false" respectively), regardless of whether we have direct evidence for either case. This is referred to as the 'law of excluded middle', because it excludes the possibility of any truth value besides 'true' or 'false'. In contrast, propositional formulae in intuitionistic logic are not assigned a definite truth value and are only considered "true" when we have direct evidence, hence proof. (We can also say, instead of the propositional formula being "true" due to direct evidence, that it is inhabited by a proof in the Curry–Howard sense.) Operations in intuitionistic logic therefore preserve justification, with respect to evidence and provability, rather than truth-valuation.

Intuitionistic logic is a commonly-used tool in developing approaches to constructivism in mathematics. The use of constructivist logics in general has been a controversial topic among mathematicians and philosophers (see, for example, the Brouwer–Hilbert controversy). A common objection to their use is the above-cited lack of two central rules of classical logic, the law of excluded middle and double negation elimination. David Hilbert considered them to be so important to the practice of mathematics that he wrote:

"Taking the principle of excluded middle from the mathematician would be the same, say, as proscribing the telescope to the astronomer or to the boxer the use of his fists. To prohibit existence statements and the principle of excluded middle is tantamount to relinquishing the science of mathematics altogether."

Intuitionistic logic has found practical use in mathematics despite the challenges presented by the inability to utilize these rules. One reason for this is that its restrictions produce proofs that have the existence property, making it also suitable for other forms of mathematical constructivism. Informally, this means that if there is a constructive proof that an object exists, that constructive proof may be used as an algorithm for generating an example of that object, a principle known as the Curry–Howard correspondence between proofs and algorithms. One reason that this particular aspect of intuitionistic logic is so valuable is that it enables practitioners to utilize a wide range of computerized tools, known as proof assistants. These tools assist their users in the generation and verification of large-scale proofs, whose size usually precludes the usual human-based checking that goes into publishing and reviewing a mathematical proof. As such, the use of proof assistants (such as Agda or Coq) is enabling modern mathematicians and logicians to develop and prove extremely complex systems, beyond those that are feasible to create and check solely by hand. One example of a proof that was impossible to satisfactorily verify without formal verification is the famous proof of the four color theorem. This theorem stumped mathematicians for more than a hundred years, until a proof was developed that ruled out large classes of possible counterexamples, yet still left open enough possibilities that a computer program was needed to finish the proof. That proof was controversial for some time, but, later, it was verified using Coq.

Syntax

The Rieger–Nishimura lattice. Its nodes are the propositional formulas in one variable up to intuitionistic logical equivalence, ordered by intuitionistic logical implication.

The syntax of formulas of intuitionistic logic is similar to propositional logic or first-order logic. However, intuitionistic connectives are not definable in terms of each other in the same way as in classical logic, hence their choice matters. In intuitionistic propositional logic (IPL) it is customary to use →, ∧, ∨, ⊥ as the basic connectives, treating ¬A as an abbreviation for (A → ⊥). In intuitionistic first-order logic both quantifiers ∃, ∀ are needed.

Hilbert-style calculus

Intuitionistic logic can be defined using the following Hilbert-style calculus. This is similar to a way of axiomatizing classical propositional logic.

In propositional logic, the inference rule is modus ponens

• MP: from [math]\displaystyle{ \phi \to \psi }[/math] and [math]\displaystyle{ \phi }[/math] infer [math]\displaystyle{ \psi }[/math]

and the axioms are

• THEN-1: [math]\displaystyle{ \psi \to (\phi \to \psi ) }[/math]
• THEN-2: [math]\displaystyle{ \big(\chi \to (\phi \to \psi )\big) \to \big((\chi \to \phi) \to (\chi \to \psi )\big) }[/math]
• AND-1: [math]\displaystyle{ \phi \land \chi \to \phi }[/math]
• AND-2: [math]\displaystyle{ \phi \land \chi \to \chi }[/math]
• AND-3: [math]\displaystyle{ \phi \to \big(\chi \to (\phi \land \chi )\big) }[/math]
• OR-1: [math]\displaystyle{ \phi \to \phi \lor \chi }[/math]
• OR-2: [math]\displaystyle{ \chi \to \phi \lor \chi }[/math]
• OR-3: [math]\displaystyle{ (\phi \to \psi ) \to \Big((\chi \to \psi ) \to \big((\phi \lor \chi) \to \psi )\Big) }[/math]
• FALSE: [math]\displaystyle{ \bot \to \phi }[/math]

To make this a system of first-order predicate logic, the generalization rules

• [math]\displaystyle{ \forall }[/math]-GEN: from [math]\displaystyle{ \psi \to \phi }[/math] infer [math]\displaystyle{ \psi \to (\forall x \ \phi ) }[/math], if [math]\displaystyle{ x }[/math] is not free in [math]\displaystyle{ \psi }[/math]
• [math]\displaystyle{ \exists }[/math]-GEN: from [math]\displaystyle{ \phi \to \psi }[/math] infer [math]\displaystyle{ (\exists x \ \phi ) \to \psi }[/math], if [math]\displaystyle{ x }[/math] is not free in [math]\displaystyle{ \psi }[/math]

are added, along with the axioms

• PRED-1: [math]\displaystyle{ (\forall x \ \phi (x)) \to \phi (t) }[/math], if the term [math]\displaystyle{ t }[/math] is free for substitution for the variable [math]\displaystyle{ x }[/math] in [math]\displaystyle{ \phi }[/math] (i.e., if no occurrence of any variable in [math]\displaystyle{ t }[/math] becomes bound in [math]\displaystyle{ \phi (t) }[/math])
• PRED-2: [math]\displaystyle{ \phi (t) \to (\exists x \ \phi (x)) }[/math], with the same restriction as for PRED-1

Negation

If one wishes to include a connective [math]\displaystyle{ \neg }[/math] for negation rather than consider it an abbreviation for [math]\displaystyle{ \phi \to \bot }[/math], it is enough to add:

• NOT-1': [math]\displaystyle{ (\phi \to \bot ) \to \neg \phi }[/math]
• NOT-2': [math]\displaystyle{ \neg \phi \to (\phi \to \bot ) }[/math]

There are a number of alternatives available if one wishes to omit the connective [math]\displaystyle{ \bot }[/math] (false). For example, one may replace the three axioms FALSE, NOT-1', and NOT-2' with the two axioms

• NOT-1: [math]\displaystyle{ (\phi \to \chi ) \to \big((\phi \to \neg \chi ) \to \neg \phi \big) }[/math]
• NOT-2: [math]\displaystyle{ \chi \to (\neg \chi \to \psi) }[/math]

as at Propositional calculus § Axioms. Alternatives to NOT-1 are [math]\displaystyle{ (\phi \to \neg \chi ) \to (\chi \to \neg \phi ) }[/math] or [math]\displaystyle{ (\phi \to \neg \phi ) \to \neg \phi }[/math].

Equivalence

The connective [math]\displaystyle{ \leftrightarrow }[/math] for equivalence may be treated as an abbreviation, with [math]\displaystyle{ \phi \leftrightarrow \chi }[/math] standing for [math]\displaystyle{ (\phi \to \chi ) \land (\chi \to \phi ) }[/math]. Alternatively, one may add the axioms

• IFF-1: [math]\displaystyle{ (\phi \leftrightarrow \chi ) \to (\phi \to \chi ) }[/math]
• IFF-2: [math]\displaystyle{ (\phi \leftrightarrow \chi ) \to (\chi \to \phi ) }[/math]
• IFF-3: [math]\displaystyle{ (\phi \to \chi ) \to ((\chi \to \phi ) \to (\phi \leftrightarrow \chi )) }[/math]

IFF-1 and IFF-2 can, if desired, be combined into a single axiom [math]\displaystyle{ (\phi \leftrightarrow \chi ) \to ((\phi \to \chi ) \land (\chi \to \phi )) }[/math] using conjunction.

Sequent calculus

Gerhard Gentzen discovered that a simple restriction of his system LK (his sequent calculus for classical logic) results in a system that is sound and complete with respect to intuitionistic logic. He called this system LJ. In LK any number of formulas is allowed to appear on the conclusion side of a sequent; in contrast LJ allows at most one formula in this position.

Other derivatives of LK are limited to intuitionistic derivations but still allow multiple conclusions in a sequent. LJ' is one example.

Theorems

The theorems of the pure logic are the statements provable from the axioms and inference rules. For example, using THEN-1 in THEN-2 reduces it to [math]\displaystyle{ \big(\chi \to (\phi \to \psi )\big) \to \big(\phi \to (\chi \to \psi )\big) }[/math]. A formal proof of the latter using the Hilbert system is given on that page. With [math]\displaystyle{ \bot }[/math] for [math]\displaystyle{ \psi }[/math], this in turn implies [math]\displaystyle{ (\chi \to \neg\phi) \to (\phi \to \neg\chi) }[/math]. In words: "If [math]\displaystyle{ \chi }[/math] being the case implies that [math]\displaystyle{ \phi }[/math] is absurd, then if [math]\displaystyle{ \phi }[/math] does hold, one has that [math]\displaystyle{ \chi }[/math] is not the case." Due to the symmetry of the statement, one in fact obtained

[math]\displaystyle{ (\chi \to \neg\phi) \leftrightarrow (\phi \to \neg\chi) }[/math]

When explaining the theorems of intuitionistic logic in terms of classical logic, it can be understood as a weakening thereof: It is more conservative in what it allows a reasoner to infer, while not permitting any new inferences that could not be made under classical logic. Each theorem of intuitionistic logic is a theorem in classical logic, but not conversely. Many tautologies in classical logic are not theorems in intuitionistic logic – in particular, as said above, one of intuitionistic logic's chief aims is to not affirm the law of the excluded middle so as to vitiate the use of non-constructive proof by contradiction, which can be used to furnish existence claims without providing explicit examples of the objects that it proves exist.

Double negations

It does merely "not affirm" the law of the excluded middle because while it is not necessarily the case that the law is upheld in any context, no counterexample can be given either. Such a counterexample would be an inference (inferring the negation of the law for a certain proposition) disallowed under classical logic and thus is not allowed in a strict weakening like intuitionistic logic. Formally, it is a simple theorem that [math]\displaystyle{ \big((\psi\lor(\psi\to\varphi))\to\varphi\big) \leftrightarrow \varphi }[/math] for any two propositions. By considering any [math]\displaystyle{ \varphi }[/math] established to be false this indeed shows that the double negation of the law [math]\displaystyle{ \neg\neg(\psi\lor\neg\psi) }[/math] is retained as a tautology already in minimal logic. So the propositional calculus is always compatible with classical logic. When assuming the law implies a proposition, then by applying contraposition twice and using the double-negated excluded middle, one may prove double-negated variants of various strictly classical tautologies. The situation is more intricate for predicate logic formulas, when some quantified expressions are being negated.

Akin to the above, from modus ponens in the form [math]\displaystyle{ \psi\to((\psi\to\varphi)\to\varphi) }[/math] follows [math]\displaystyle{ \psi\to\neg\neg\psi }[/math]. The relation between them may always be used to obtain new formulas: A weakened premise makes for a strong implication, and vice versa. For example, note that if [math]\displaystyle{ (\neg\neg \psi) \to \phi }[/math] holds, then so does [math]\displaystyle{ \psi \to \phi }[/math], but the schema in the other direction would imply the double-negation elimination principle. Propositions for which double-negation elimination is possible are also called stable. Intuitionistic logic proves stability only for restricted types of propositions, such as those of negated form. A formula for which excluded middle holds can be proven stable using the disjunctive syllogism, which is discussed more thoroughly below. The converse does however not hold in general, unless the excluded middle statement at hand is stable itself. Even weaker than [math]\displaystyle{ \psi \to \phi }[/math] is [math]\displaystyle{ \neg\neg (\psi \to \phi) }[/math], which itself implies the three equivalent statements [math]\displaystyle{ \psi \to (\neg\neg \phi) }[/math], [math]\displaystyle{ \neg\phi\to\neg\psi }[/math] and [math]\displaystyle{ (\neg\neg \psi) \to (\neg\neg \phi) }[/math]. Using the disjunctive syllogism, the previous four are indeed equivalent. This also gives an intuitionistically valid derivation of [math]\displaystyle{ \neg\neg(\neg\neg\phi\to\phi) }[/math], as it is thus equivalent to an identity.

When [math]\displaystyle{ \psi }[/math] expresses a claim, then its double-negation [math]\displaystyle{ \neg\neg\psi }[/math] merely expresses the claim that a refutation of [math]\displaystyle{ \psi }[/math] would be inconsistent. Having proven such a mere double-negation also still aids in negating other statements through negation introduction, as then [math]\displaystyle{ (\phi\to\neg\psi)\to\neg\phi }[/math]. A double-negated existential statement does not denote existence of an entity with a property, but rather the absurdity of assumed non-existence of any such entity. Also all the principles in the next section involving quantifiers explain use of implications with hypothetical existence as premise.

Formula translation

Weakening statements by adding two negations before existential quantifiers (and atoms) is also the core step in the double-negation translation. It constitutes an embedding of classical first-order logic into intuitionistic logic: a first-order formula is provable in classical logic if and only if its Gödel–Gentzen translation is provable intuitionistically. For example, any theorem of classical propositional logic of the form [math]\displaystyle{ \psi\to\phi }[/math] has a proof consisting of an intuitionistic proof of [math]\displaystyle{ \psi\to\neg\neg\phi }[/math] followed by one application of double-negation elimination. Intuitionistic logic can thus be seen as a means of extending classical logic with constructive semantics.

Non-interdefinability of operators

Already minimal logic easily proves the following three theorems, relating conjunction resp. disjunction to the implication using negation:

[math]\displaystyle{ (\phi \lor \psi) \to \neg (\neg \phi \land \neg \psi) }[/math]

[math]\displaystyle{ (\phi \lor \psi) \to (\neg \phi \to \neg \neg \psi) }[/math], a weakened variant of the disjunctive syllogism

resp.

[math]\displaystyle{ (\phi \land \psi) \to \neg (\neg \phi \lor \neg \psi) }[/math]

[math]\displaystyle{ (\phi \land \psi) \to \neg (\phi \to \neg \psi) }[/math] and similarly [math]\displaystyle{ (\phi \to \psi) \to \neg (\phi \land \neg\psi) }[/math]

Indeed, stronger variants of these, with [math]\displaystyle{ \psi }[/math] replaced by [math]\displaystyle{ \neg\neg\psi }[/math] on the left, still do hold, as will be discussed. However, neither of these five implications can be reversed without immediately implying excluded middle (consider [math]\displaystyle{ \neg \psi }[/math] for [math]\displaystyle{ \phi }[/math]) resp. double-negation elimination (consider true [math]\displaystyle{ \phi }[/math]). Hence, the left hand sides do not constitute a possible definition of the right hand sides.

In contrast, in classical propositional logic it is possible to take one of those three connectives plus negation as primitive and define the other two in terms of it, in this way. Such is done, for example, in Łukasiewicz's three axioms of propositional logic. It is even possible to define all in terms of a sole sufficient operator such as the Peirce arrow (NOR) or Sheffer stroke (NAND). Similarly, in classical first-order logic, one of the quantifiers can be defined in terms of the other and negation. These are fundamentally consequences of the law of bivalence, which makes all such connectives merely Boolean functions. The law of bivalence is not required to hold in intuitionistic logic. As a result, none of the basic connectives can be dispensed with, and the above axioms are all necessary. So most of the classical identities between connectives and quantifiers are only theorems of intuitionistic logic in one direction. Some of the theorems go in both directions, i.e. are equivalences, as subsequently discussed.

Existential vs. universal quantification

Firstly, when [math]\displaystyle{ x }[/math] is not free in the proposition [math]\displaystyle{ \varphi }[/math], then

[math]\displaystyle{ \big(\exists x\, (\phi(x)\to \varphi)\big)\,\,\to\,\,\Big(\big(\forall x \ \phi(x)\big)\to\varphi\Big) }[/math]

When the domain of discourse is empty, then by the principle of explosion, an existential statement implies anything. When the domain contains at least one term, then assuming excluded middle for [math]\displaystyle{ \forall x \, \phi(x) }[/math], the inverse of the above implication becomes provably too, meaning the two sides become equivalent. This inverse direction is equivalent to the drinker's paradox (DP). Moreover, an existential and dual variant of it is given by the independence of premise principle (IP). Classically, the statement above is moreover equivalent to a more disjunctive form discussed further below. Constructively, existence claims are however generally harder to come by.

If the domain of discourse is not empty and [math]\displaystyle{ \phi }[/math] is moreover independent of [math]\displaystyle{ x }[/math], such principles are equivalent to formulas in the propositional calculus. Here, the formula then just expresses the identity [math]\displaystyle{ (\phi\to\varphi)\to(\phi\to\varphi) }[/math]. This is the curried form of modus ponens [math]\displaystyle{ ((\phi\to\varphi)\land\phi)\to\varphi }[/math], which in the special the case with [math]\displaystyle{ \varphi }[/math] as a false proposition results in the law of non-contradiction principle [math]\displaystyle{ \neg(\phi\land\neg\phi) }[/math]. Considering a false proposition [math]\displaystyle{ \varphi }[/math] for the original implication results in the important

• [math]\displaystyle{ (\exists x \ \neg \phi(x)) \to \neg (\forall x \ \phi(x)) }[/math]

In words: "If there exists an entity [math]\displaystyle{ x }[/math] that does not have the property [math]\displaystyle{ \phi }[/math], then the following is refuted: Each entity has the property [math]\displaystyle{ \phi }[/math]."

The quantifier formula with negations also immediately follows from the non-contradiction principle derived above, each instance of which itself already follows from the more particular [math]\displaystyle{ \neg(\neg\neg\phi\land\neg\phi) }[/math]. To derive a contradiction given [math]\displaystyle{ \neg\phi }[/math], it suffices to establish its negation [math]\displaystyle{ \neg\neg\phi }[/math] (as opposed to the stronger [math]\displaystyle{ \phi }[/math]) and this makes proving double-negations valuable also. By the same token, the original quantifier formula in fact still holds with [math]\displaystyle{ \forall x \ \phi(x) }[/math] weakened to [math]\displaystyle{ \forall x \big((\phi(x)\to\varphi)\to\varphi\big) }[/math]. And so, in fact, a stronger theorem holds:

[math]\displaystyle{ (\exists x \ \neg \phi(x)) \to \neg (\forall x \, \neg\neg\phi(x)) }[/math]

In words: "If there exists an entity [math]\displaystyle{ x }[/math] that does not have the property [math]\displaystyle{ \phi }[/math], then the following is refuted: For each entity, one is not able to prove that it does not have the property [math]\displaystyle{ \phi }[/math]".

Secondly,

[math]\displaystyle{ \big(\forall x \, (\phi(x)\to \varphi)\big)\,\,\leftrightarrow\,\,\big((\exists x \ \phi(x))\to\varphi\big) }[/math]

where similar considerations apply. Here the existential part is always a hypothesis and this is an equivalence. Considering the special case again,

• [math]\displaystyle{ (\forall x \ \neg \phi(x)) \leftrightarrow \neg (\exists x \ \phi(x)) }[/math]

The proven conversion [math]\displaystyle{ (\chi\to\neg \phi)\leftrightarrow(\phi\to\neg \chi) }[/math] can be used to obtain two further implications:

[math]\displaystyle{ (\forall x \ \phi(x)) \to \neg (\exists x \ \neg \phi(x)) }[/math]

[math]\displaystyle{ (\exists x \ \phi(x)) \to \neg (\forall x \ \neg \phi(x)) }[/math]

Of course, variants of such formulas can also be derived that have the double-negations in the antecedent. A special case of the first formula here is [math]\displaystyle{ (\forall x \, \neg\phi(x)) \to \neg (\exists x \, \neg \neg \phi(x)) }[/math] and this is indeed stronger than the [math]\displaystyle{ \to }[/math]-direction of the equivalence bullet point listed above. For simplicity of the discussion here and below, the formulas are generally presented in weakened forms without all possible insertions of double-negations in the antecedents.

More general variants hold. Incorporating the predicate [math]\displaystyle{ \psi }[/math] and currying, the following generalization also entails the relation between implication and conjunction in the predicate calculus, discussed below.

[math]\displaystyle{ \big(\forall x \ \phi(x)\to (\psi(x)\to\varphi)\big)\,\,\leftrightarrow\,\,\Big(\big(\exists x \ \phi(x)\land \psi(x)\big)\to\varphi\Big) }[/math]

If the predicate [math]\displaystyle{ \psi }[/math] is decidedly false for all [math]\displaystyle{ x }[/math], then this equivalence is trivial. If [math]\displaystyle{ \psi }[/math] is decidedly true for all [math]\displaystyle{ x }[/math], the schema simply reduces to the previously stated equivalence. In the language of classes, [math]\displaystyle{ A=\{x\mid\phi(x)\} }[/math] and [math]\displaystyle{ B=\{x\mid\psi(x)\} }[/math], the special case of this equivalence with false [math]\displaystyle{ \varphi }[/math] equates two characterizations of disjointness [math]\displaystyle{ A\cap B=\emptyset }[/math]:

[math]\displaystyle{ \forall(x\in A).x\notin B\,\,\leftrightarrow\,\,\neg\exists(x\in A).x\in B }[/math]

Disjunction vs. conjunction

There are finite variations of the quantifier formulas, with just two propositions:

• [math]\displaystyle{ (\neg \phi \lor \neg \psi) \to \neg (\phi \land \psi) }[/math]
• [math]\displaystyle{ (\neg \phi \land \neg \psi) \leftrightarrow \neg (\phi \lor \psi) }[/math]

The first principle cannot be reversed: Considering [math]\displaystyle{ \neg \psi }[/math] for [math]\displaystyle{ \phi }[/math] would imply the weak excluded middle, i.e. the statement [math]\displaystyle{ \neg \psi \lor \neg \neg \psi }[/math]. But intuitionistic logic alone does not even prove [math]\displaystyle{ \neg \psi \lor \neg \neg \psi\lor (\neg \neg \psi\to \psi) }[/math]. So in particular, there is no distributivity principle for negations deriving the claim [math]\displaystyle{ \neg \phi \lor \neg \psi }[/math] from [math]\displaystyle{ \neg(\phi \land \psi) }[/math]. For an informal example of the constructive reading, consider the following: From conclusive evidence it not to be the case that both Alice and Bob showed up to their date, one cannot derive conclusive evidence, tied to either of the two persons, that this person did not show up. Negated propositions are comparably weak, in that the classically valid De Morgan's law, granting a disjunction from a single negative hypothetical, does not automatically hold constructively. The intuitionistic propositional calculus and some of its extensions exhibit the disjunction property instead, implying one of the disjuncts of any disjunction individually would have to be derivable as well.

The converse variants of those two had already been mentioned above. But as noted, stronger forms of these formulas hold, e.g. [math]\displaystyle{ (\neg\neg\phi \land \neg\neg\psi) \to \neg (\neg \phi \lor \neg \psi) }[/math]. This can easily be derived from the non-contradiction principle, as all of the formulas are about deriving absurd consequences from hypotheticals, and these statements do not have to be placed in a particular order. By the same reasoning, one may obtain the mixed form of the implication and its converse, [math]\displaystyle{ (\neg \phi \lor \psi) \to \neg (\phi \land \neg \psi) }[/math] and [math]\displaystyle{ (\neg \phi \land \psi) \to \neg (\phi \lor \neg \psi) }[/math].

In predicate logic, [math]\displaystyle{ \forall x \big(\varphi \lor \psi(x)\big) }[/math] does not imply the stronger [math]\displaystyle{ \varphi\lor \forall x\,\psi(x) }[/math], albeit the distributive properties hold for any finite number of propositions. For a variant of the De Morgan law concerning two existentially closed decidable predicates, see LLPO.

Conjunction vs. implication

From the general equivalence also follows import-export, expressing incompatibility of two predicates using two different connectives:

• [math]\displaystyle{ (\phi \to \neg \psi) \leftrightarrow \neg (\phi \land \psi) }[/math]

Due to the symmetry of the conjunction connective, this again implies the already established [math]\displaystyle{ (\phi \to \neg \psi) \leftrightarrow (\psi \to \neg \phi) }[/math]. The equivalence formula for the negated conjunction may be understood as a special case of currying and uncurrying. Many more considerations regarding double-negations again apply. And both non-reversible theorems relating conjunction and implication mentioned in the introduction follow from this equivalence. One is a converse, and [math]\displaystyle{ (\phi \to \psi) \to \neg (\phi \land \neg\psi) }[/math] holds simply because [math]\displaystyle{ \phi \to \psi }[/math] is stronger than [math]\displaystyle{ \phi \to \neg\neg\psi }[/math].

Now when using the principle in the next section, the following variant of the latter, with more negations on the left, also holds:

• [math]\displaystyle{ \neg (\phi \to \psi) \leftrightarrow (\neg \neg \phi \land \neg \psi) }[/math]

A consequence is that

• [math]\displaystyle{ \neg \neg (\phi \land \psi) \leftrightarrow (\neg \neg \phi \land \neg \neg \psi) }[/math]

The analog of this for the disjunction cannot be a theorem, as it would prove weak excluded middle.

Disjunction vs. implication

Akin to modus ponens, clearly [math]\displaystyle{ (\phi \lor \psi)\to((\phi\to\psi)\to \psi) }[/math] already in minimal logic, and this theorem does not even involve negations. Classically, this is an equivalence. In intuitionistic logic, one obtains variants involving [math]\displaystyle{ \bot }[/math], as follows. Firstly, note that two different formulas for [math]\displaystyle{ \neg (\phi \land \psi) }[/math] mentioned above can be used to imply [math]\displaystyle{ (\neg \phi \vee \neg \psi) \to (\phi \to \neg \psi) }[/math]. The latter are forms of the disjunctive syllogism for negated propositions, [math]\displaystyle{ \neg\psi }[/math]. A strengthened form still holds in intuitionistic logic:

• [math]\displaystyle{ (\neg \phi \lor \psi) \to (\phi \to \psi) }[/math]

As in previous sections, the positions of [math]\displaystyle{ \neg \phi }[/math] and [math]\displaystyle{ \phi }[/math] may be switched, giving a stronger principle than the one mentioned in the introduction. Also, [math]\displaystyle{ \phi }[/math] may be weakened to [math]\displaystyle{ \neg\neg\phi }[/math]. These principles are provable from non-contradiction and explosion. So, for example, intuitionistically "Either [math]\displaystyle{ P }[/math] or [math]\displaystyle{ Q }[/math]" is a stronger propositional formula than "If not [math]\displaystyle{ P }[/math], then [math]\displaystyle{ Q }[/math]", whereas these are classically interchangeable. The implication cannot generally be reversed, as that immediately implies excluded middle.

Considering [math]\displaystyle{ \neg\neg\psi }[/math] in place of [math]\displaystyle{ \phi }[/math] in the above form of the syllogism shows how excluded middle implies double-negation elimination.

Of course the formulas established here may be combined to obtain yet more variations. For example, the disjunctive syllogism as presented generalizes to

[math]\displaystyle{ \Big(\big(\exists x \ \neg\phi(x)\big)\lor\varphi\Big)\,\,\to\,\,\Big(\big(\forall x \ \phi(x)\big)\to\varphi\Big) }[/math]

If some term exists at all, the antecedent here even implies [math]\displaystyle{ \exists x \big(\phi(x)\to\varphi\big) }[/math], which in turn itself also implies the conclusion here (this is again the very first formula mentioned in this section).

The bulk of the discussion in these sections applies just as well to just minimal logic. But as for the disjunctive syllogism with general [math]\displaystyle{ \psi }[/math], minimal logic can at most prove [math]\displaystyle{ (\neg\phi \lor \psi) \to (\neg\neg \phi \to \psi') }[/math] where [math]\displaystyle{ \psi' }[/math] denotes [math]\displaystyle{ \neg\neg\psi\land(\psi\lor\neg\psi) }[/math]. The conclusion here can only be simplified to [math]\displaystyle{ \psi }[/math] using explosion.

Equivalences

The above lists also contain equivalences. The equivalence involving a conjunction and a disjunction stems from [math]\displaystyle{ (P\lor Q)\to R }[/math] actually being stronger than [math]\displaystyle{ P\to R }[/math]. Both sides of the equivalence can be understood as conjunctions of independent implications. Above, absurdity [math]\displaystyle{ \bot }[/math] is used for [math]\displaystyle{ R }[/math]. In functional interpretations, it corresponds to if-clause constructions. So e.g. "Not ([math]\displaystyle{ P }[/math] or [math]\displaystyle{ Q }[/math])" is equivalent to "Not [math]\displaystyle{ P }[/math], and also not [math]\displaystyle{ Q }[/math]".

An equivalence itself is generally defined as, and then equivalent to, a conjunction of implications

• [math]\displaystyle{ (\phi\leftrightarrow \psi) \leftrightarrow \big((\phi \to \psi)\land(\psi\to\phi)\big) }[/math]

With it, such connectives become in turn definable from it:

• [math]\displaystyle{ (\phi\to\psi) \leftrightarrow ((\phi\lor\psi) \leftrightarrow \psi) }[/math]
• [math]\displaystyle{ (\phi\to\psi) \leftrightarrow ((\phi\land\psi) \leftrightarrow \phi) }[/math]
• [math]\displaystyle{ (\phi\land\psi) \leftrightarrow ((\phi\to\psi)\leftrightarrow\phi) }[/math]
• [math]\displaystyle{ (\phi\land\psi) \leftrightarrow (((\phi\lor\psi)\leftrightarrow\psi)\leftrightarrow\phi) }[/math]

In turn, [math]\displaystyle{ \{\lor, \leftrightarrow, \bot\} }[/math] and [math]\displaystyle{ \{\land, \leftrightarrow, \neg\} }[/math] are complete bases of intuitionistic connectives.

Functionally complete connectives

As shown by Alexander V. Kuznetsov, either of the following connectives – the first one ternary, the second one quinary – is by itself functionally complete: either one can serve the role of a sole sufficient operator for intuitionistic propositional logic, thus forming an analog of the Sheffer stroke from classical propositional logic:

• [math]\displaystyle{ \big((P\lor Q)\land\neg R\big)\lor\big(\neg P\land(Q\leftrightarrow R)\big) }[/math]
• [math]\displaystyle{ P\to\big(Q\land\neg R\land(S\lor T)\big) }[/math]

Semantics

The semantics are rather more complicated than for the classical case. A model theory can be given by Heyting algebras or, equivalently, by Kripke semantics. Recently, a Tarski-like model theory was proved complete by Bob Constable, but with a different notion of completeness than classically.

Unproved statements in intuitionistic logic are not given an intermediate truth value (as is sometimes mistakenly asserted). One can prove that such statements have no third truth value, a result dating back to Glivenko in 1928. Instead they remain of unknown truth value, until they are either proved or disproved. Statements are disproved by deducing a contradiction from them.

A consequence of this point of view is that intuitionistic logic has no interpretation as a two-valued logic, nor even as a finite-valued logic, in the familiar sense. Although intuitionistic logic retains the trivial propositions [math]\displaystyle{ \{\top, \bot\} }[/math] from classical logic, each proof of a propositional formula is considered a valid propositional value, thus by Heyting's notion of propositions-as-sets, propositional formulae are (potentially non-finite) sets of their proofs.

Heyting algebra semantics

In classical logic, we often discuss the truth values that a formula can take. The values are usually chosen as the members of a Boolean algebra. The meet and join operations in the Boolean algebra are identified with the ∧ and ∨ logical connectives, so that the value of a formula of the form A ∧ B is the meet of the value of A and the value of B in the Boolean algebra. Then we have the useful theorem that a formula is a valid proposition of classical logic if and only if its value is 1 for every valuation—that is, for any assignment of values to its variables.

A corresponding theorem is true for intuitionistic logic, but instead of assigning each formula a value from a Boolean algebra, one uses values from a Heyting algebra, of which Boolean algebras are a special case. A formula is valid in intuitionistic logic if and only if it receives the value of the top element for any valuation on any Heyting algebra.

It can be shown that to recognize valid formulas, it is sufficient to consider a single Heyting algebra whose elements are the open subsets of the real line R. In this algebra we have:

[math]\displaystyle{ \begin{align} \text{Value}[\bot] &=\emptyset \\ \text{Value}[\top] &= \mathbf{R} \\ \text{Value}[A \land B] &= \text{Value}[A] \cap \text{Value}[B] \\ \text{Value}[A \lor B] &= \text{Value}[A] \cup \text{Value}[B] \\ \text{Value}[A \to B] &= \text{int} \left ( \text{Value}[A]^\complement \cup \text{Value}[B] \right ) \end{align} }[/math]

where int(X) is the interior of X and X^∁ its complement.

The last identity concerning A → B allows us to calculate the value of ¬A:

[math]\displaystyle{ \begin{align} \text{Value}[\neg A] &= \text{Value}[A \to \bot] \\ &= \text{int} \left ( \text{Value}[A]^\complement \cup \text{Value}[\bot] \right ) \\ &= \text{int} \left ( \text{Value}[A]^\complement \cup \emptyset \right ) \\ &= \text{int} \left ( \text{Value}[A]^\complement \right ) \end{align} }[/math]

With these assignments, intuitionistically valid formulas are precisely those that are assigned the value of the entire line. For example, the formula ¬(A ∧ ¬A) is valid, because no matter what set X is chosen as the value of the formula A, the value of ¬(A ∧ ¬A) can be shown to be the entire line:

[math]\displaystyle{ \begin{align} \text{Value}[\neg(A \land \neg A)] &= \text{int} \left ( \text{Value} [A \land \neg A]^\complement \right ) && \text{Value}[\neg B] = \text{int}\left ( \text{Value}[B]^\complement \right) \\ &= \text{int} \left ( \left (\text{Value}[A] \cap \text{Value}[\neg A] \right )^\complement \right )\\ &= \text{int} \left ( \left (\text{Value}[A] \cap \text{int} \left (\text{Value}[A]^\complement \right ) \right )^\complement \right ) \\ &= \text{int} \left ( \left (X \cap \text{int} \left (X^\complement \right ) \right )^\complement \right ) \\ &= \text{int} \left (\emptyset^\complement \right ) && \text{int} \left (X^\complement \right ) \subseteq X^\complement \\ &= \text{int} (\mathbf{R}) \\ &= \mathbf{R} \end{align} }[/math]

So the valuation of this formula is true, and indeed the formula is valid. But the law of the excluded middle, A ∨ ¬A, can be shown to be invalid by using a specific value of the set of positive real numbers for A:

[math]\displaystyle{ \begin{align} \text{Value}[A \lor \neg A] &= \text{Value}[A] \cup \text{Value}[\neg A] \\ &= \text{Value}[A] \cup \text{int} \left ( \text{Value}[A]^\complement \right) && \text{Value}[\neg B] = \text{int}\left ( \text{Value}[B]^\complement \right) \\ &= \{ x \gt 0\} \cup \text{int} \left ( \{x \gt 0\}^\complement \right ) \\ &= \{ x \gt 0\} \cup \text{int} \left ( \{x \leqslant 0 \} \right) \\ &= \{ x \gt 0\} \cup \{x \lt 0 \} \\ &=\{ x \neq 0 \} \\ &\neq \mathbf{R} \end{align} }[/math]

The interpretation of any intuitionistically valid formula in the infinite Heyting algebra described above results in the top element, representing true, as the valuation of the formula, regardless of what values from the algebra are assigned to the variables of the formula. Conversely, for every invalid formula, there is an assignment of values to the variables that yields a valuation that differs from the top element. No finite Heyting algebra has the second of these two properties.

Kripke semantics

Building upon his work on semantics of modal logic, Saul Kripke created another semantics for intuitionistic logic, known as Kripke semantics or relational semantics.

Tarski-like semantics

It was discovered that Tarski-like semantics for intuitionistic logic were not possible to prove complete. However, Robert Constable has shown that a weaker notion of completeness still holds for intuitionistic logic under a Tarski-like model. In this notion of completeness we are concerned not with all of the statements that are true of every model, but with the statements that are true in the same way in every model. That is, a single proof that the model judges a formula to be true must be valid for every model. In this case, there is not only a proof of completeness, but one that is valid according to intuitionistic logic.

Metalogic

Admissible rules

In intuitionistic logic or a fixed theory using the logic, the situation can occur that an implication always hold metatheoretically, but not in the language. For example, in the pure propositional calculus, if [math]\displaystyle{ (\neg A)\to(B\lor C) }[/math] is provable, then so is [math]\displaystyle{ (\neg A\to B)\lor(\neg A\to C) }[/math]. Another example is that [math]\displaystyle{ (A\to B)\to(A\lor C) }[/math] being provable always also means that so is [math]\displaystyle{ \big((A\to B)\to A\big)\lor\big((A\to B)\to C\big) }[/math]. One says the system is closed under these implications as rules and they may be adopted.

Relation to other logics

Paraconsistent logic

Intuitionistic logic is related by duality to a paraconsistent logic known as Brazilian, anti-intuitionistic or dual-intuitionistic logic.

The subsystem of intuitionistic logic with the FALSE (resp. NOT-2) axiom removed is known as minimal logic and some differences have been elaborated on above.

Intermediate logics

In 1932, Kurt Gödel defined a system of logics intermediate between classical and intuitionistic logic. Indeed, any finite Heyting algebra that is not equivalent to a Boolean algebra defines (semantically) an intermediate logic. On the other hand, validity of formulae in pure intuitionistic logic is not tied to any individual Heyting algebra but relates to any and all Heyting algebras at the same time.

So for example, for a schema not involving negations, consider the classically valid [math]\displaystyle{ (A\to B)\lor(B\to A) }[/math]. Adopting this over intuitionistic logic gives the intermediate logic called Gödel-Dummett logic.

Relation to classical logic

The system of classical logic is obtained by adding any one of the following axioms:

• [math]\displaystyle{ \phi \lor \neg \phi }[/math] (Law of the excluded middle. May also be formulated as [math]\displaystyle{ (\phi \to \chi ) \to ((\neg \phi \to \chi ) \to \chi ) }[/math].)
• [math]\displaystyle{ \neg \neg \phi \to \phi }[/math] (Double negation elimination)
• [math]\displaystyle{ ((\phi \to \chi ) \to \phi ) \to \phi }[/math] (Peirce's law)
• [math]\displaystyle{ (\neg \phi \to \neg \chi ) \to (\chi \to \phi ) }[/math] (Law of contraposition)

In general, one may take as the extra axiom any classical tautology that is not valid in the two-element Kripke frame [math]\displaystyle{ \circ{\longrightarrow}\circ }[/math] (in other words, that is not included in Smetanich's logic).

Many-valued logic

Kurt Gödel's work involving many-valued logic showed in 1932 that intuitionistic logic is not a finite-valued logic. (See the section titled Heyting algebra semantics above for an infinite-valued logic interpretation of intuitionistic logic.)

Modal logic

Any formula of the intuitionistic propositional logic (IPC) may be translated into the language of the normal modal logic S4 as follows:

[math]\displaystyle{ \begin{align} \bot^* &= \bot \\ A^* &= \Box A && \text{if } A \text{ is prime (a positive literal)} \\ (A \wedge B)^*&= A^* \wedge B^* \\ (A \vee B)^* &= A^* \vee B^* \\ (A \to B)^*&= \Box \left (A^* \to B^* \right ) \\ (\neg A)^*&= \Box(\neg (A^*)) && \neg A := A \to \bot \end{align} }[/math]

and it has been demonstrated that the translated formula is valid in the propositional modal logic S4 if and only if the original formula is valid in IPC. The above set of formulae are called the Gödel–McKinsey–Tarski translation. There is also an intuitionistic version of modal logic S4 called Constructive Modal Logic CS4.

Lambda calculus

There is an extended Curry–Howard isomorphism between IPC and simply-typed lambda calculus.

See also

• BHK interpretation
• Computability logic
• Constructive analysis
• Constructive proof
• Constructive set theory
• Curry–Howard correspondence
• Game semantics
• Harrop formula
• Heyting arithmetic
• Inhabited set
• Intermediate logics
• Intuitionistic type theory
• Kripke semantics
• Linear logic
• Paraconsistent logic
• Realizability
• Relevance theory
• Smooth infinitesimal analysis

References

• Alechina, Natasha; Mendler, Michael; De Paiva, Valeria; Ritter, Eike (January 2003). "Categorical and Kripke Semantics for Constructive S4 Modal Logic". Proceedings of the 15th International Workshop on Computer Science Logic. doi:10.1007/3-540-44802-0_21. http://www.cs.nott.ac.uk/~nza/papers/Alechina++:01a.pdf. 

• Aoyama, Hiroshi (2004). "LK, LJ, Dual Intuitionistic Logic, and Quantum Logic". Notre Dame Journal of Formal Logic 45 (4): 193–213. doi:10.1305/ndjfl/1099238445. 

• Bezhanishvili, Nick; De Jongh, Dick. "Intuitionistic Logic". University of Amsterdam (Institute for Logic, Language and Computation). http://www.cs.le.ac.uk/people/nb118/Publications/ESSLLI'05.pdf. 

• Brunner, A.B.M.; Carnielli, Walter (March 2005). "Anti-intuitionism and paraconsistency". Journal of Applied Logic 3 (1): 161–184. doi:10.1016/j.jal.2004.07.016. 

• Burgess, John (January 2014). "Intuitions of Three Kinds in Gödel's Views on the Continuum". doi:10.1017/CBO9780511756306.002. https://www.princeton.edu/~jburgess/Goedel.pdf. 

• Chagrov, Alexander; Zakharyaschev, Michael (1997). Modal Logic. Oxford Logic Guides. 35. Oxford University Press. pp. XV, 605. ISBN 0-19-853779-4. 

• Constable, R.; Bickford, M. (2014). "Intuitionistic completeness of first-order logic". Annals of Pure and Applied Logic 165: 164–198. doi:10.1016/j.apal.2013.07.009. 

• Van Dalen, Dirk (2001). "Intuitionistic Logic". in Goble, Lou. The Blackwell Guide to Philosophical Logic. New York: Blackwell Publishing. pp. 224–257. doi:10.1002/9781405164801.ch11. ISBN 9780631206934. 

• Heyting, Arend (1930) (in de). Die formalen Regeln der intuitionistischen Logik I, II, III. Sitzungsberichte der preussischen Akademie der Wissenschaften. pp. 42–56, 57–71, 158–169. "In three parts" 

• Japaridze, Giorgi (January 2009). "In the Beginning was Game Semantics?". in Majer, O.; Pietarinen, A.-V.; Tulenheimo, T.. Games: Unifying Logic, Language and Philosophy. Springer. pp. 249-350. https://link.springer.com/chapter/10.1007%2F978-1-4020-9374-6_11. 

• Kripke, Saul A. (1965). "Semantical analysis of intuitionistic logic I". in Crossley, J.N.; Dummett, M.A.E.. Formal Systems and Recursive Functions. Proceedings of the Eighth Logic Colloquium Oxford, July 1963. Studies in Logic and the Foundations of Mathematics. 40. Amsterdam: North-Holland Publishing Company. pp. 92–130. doi:10.1016/S0049-237X(08)71685-9. ISBN 9780444534057. https://www.princeton.edu/~hhalvors/restricted/kripke_intuitionism.pdf. 

• Lévy, Michel (29 April 2011) (in fr), Logique modale propositionnelle S4 et logique intuitioniste propositionnelle, http://teachinglogic.liglab.fr/INT1/S4Lint.pdf 

• Rasiowa, Helena; Sikorski, Roman (1963). The Mathematics of Metamathematics. Monografie matematyczne. Warsaw: Państwowe Wydawn. Naukowe. pp. 519. https://archive.org/details/mathematicsmetam00rasi_119. 

• Shehtman, Valentin (1990). "Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable". Studia Logica 49 (3): 365–385. doi:10.1007/BF00370370. https://link.springer.com/article/10.1007/BF00370370. 

• Sørensen, Morten H.; Urzyczyn, Paweł (2006). "chapter 2: Intuitionistic Logic". Lectures on the Curry-Howard Isomorphism. Studies in Logic and the Foundations of Mathematics. 149 (1 ed.). Amsterdam: Elsevier. ISBN 978-0-444-52077-7. 

• Takeuti, Gaisi (2013). Proof theory (Second ed.). Mineola, New York: Dover Publications. ISBN 978-0-486-49073-1. https://books.google.com/books?id=Idl6K-W69NYC. 

• Tarski, Alfred (1938). "Der Aussagenkalkül und die Topologie". Fundamenta Mathematicae 31: 103-134. doi:10.1007/BF00370370. http://matwbn.icm.edu.pl/tresc.php?wyd=1&tom=31. 

• Troelstra, A.S.; Van Ulsen, P.. "The discovery of E.W. Beth’s semantics for intuitionistic logic". Institute for Logic, Language and Computation (ILLC). Universiteit van Amsterdam. https://festschriften.illc.uva.nl/j50/contribs/troelstra/troelstra.pdf. 

External links

• Van Atten, Mark (4 May 2022). "The Development of Intuitionistic Logic". in Zalta, Edward N.. Stanford Encyclopedia of Philosophy. https://plato.stanford.edu/entries/intuitionistic-logic-development/. 

• McCarty, David Charles. "Intuitionism in Mathematics". in Shapiro, Stewart. The Oxford Handbook of Philosophy of Mathematics and Logic. pp. 356–386. doi:10.1093/oxfordhb/9780195325928.003.0010. 

• Moschovakis, Joan (16 December 2022). "Intuitionistic Logic". in Zalta, Edward N.. Stanford Encyclopedia of Philosophy. https://plato.stanford.edu/entries/logic-intuitionistic/. 

• "Tableaux'method for intuitionistic logic through S4-translation". Laboratoire d'Informatique de Grenoble. http://teachinglogic.liglab.fr/INT1/index.php. "tests the intuitionistic validity of propositional formulae"