implication (changes) in nLab

Showing changes from revision #14 to #15: Added | Removed | Changed

Implication

Definitions

An implication may be either an entailment or a conditional statement; these are closely related but not quite the same thing.

1. Entailment is a preorder on propositions within a given context in a given logic.

   We say that pp entails qq syntactically, written as a sequent p⊢qp \vdash q, if qq can be proved from the assumption pp.

   We say that pp entails qq semantically, written p⊨qp \vDash q, if qq holds in every model in which pp holds.

   (These relations are often equivalent, by various soundness? and completeness theorems.)

2. A conditional statement is the result of a binary operation on propositions within a given context in a given logic. If pp and qq are propositions in some context, then so is the conditional statement p→qp \to q, at least if the logic has a notion of conditional.

Notice that pp, qq, and p→qp \to q are all statements in the object language (the language that we are talking about), whereas the hypothetical judgements p⊢qp \vdash q and p⊨qp \vDash q are statements in the metalanguage (the language that we are using to talk about the object language).

Relations between the definitions

Depending on what logic one is using, p→qp \to q might be anything, but it's probably not fair to consider it a conditional statement unless it is related to entailment as follows:

If, in some context, pp entails qq (either syntactically or semantically), then p→qp \to q is a theorem (syntactically) or a tautology (semantically) in that context, and conversely.

In particular, this holds for classical logic and intuitionistic logic.

You can think of entailment as being an external hom (taking values in the poset of truth values) and the conditional as being an internal hom (taking values in the poset of propositions). In particular, we expect these to be related as in a closed category:

• q→r⊢(p→q)→(p→r) q \to r \vdash (p \to q) \to (p \to r) ,
• p≡⊤→p p \equiv \top \to p ,
• ⊤⊢p→p \top \vdash p \to p ,

where ⊤\top is an appropriate constant statement (often satisfying p⊢⊤p \vdash \top, although not always, as in linear logic with ⊸\multimap for →\to and 11 for ⊤\top).

Most kinds of logic used in practice have a notion of entailment from a list of multiple premises; then we expect entailment and the conditional to be related as in a closed multicategory.

Just as we may identify the internal and external hom in Set, so we may identify the entailment and conditional of truth values. In the nnLab, we tend to write this as ⇒\Rightarrow, a symbol that is variously used by other authors in place of ⊢\vdash, ⊨\vDash, and →\rightarrow.

In various formalizations

In Heyting algebras

Although Heyting algebras were first developed as a way to discuss intuitionistic logic, they appear in other contexts; but their characterstic feature is that they have an operation analogous to the conditional operation in logic, usually called Heyting implication and denoted →\rightarrow or ⇒\Rightarrow. If you use →\to and replace ⊢\vdash above with the Heyting algebra's partial order ≤\leq, then everything above applies.

In natural deduction

In natural deduction the inference rules for implication are given as

Γ⊢PpropΓ⊢QpropΓ⊢P→QpropΓ⊢PpropΓ,Ptrue⊢QtrueΓ⊢P→QtrueΓ⊢P→QtrueΓ,Ptrue⊢Qtrue\frac{\Gamma \vdash P \; \mathrm{prop} \quad \Gamma \vdash Q \; \mathrm{prop}}{\Gamma \vdash P \to Q \; \mathrm{prop}} \qquad \frac{\Gamma \vdash P \; \mathrm{prop} \quad \Gamma, P \; \mathrm{true} \vdash Q \; \mathrm{true}}{\Gamma \vdash P \to Q \; \mathrm{true}} \qquad \frac{\Gamma \vdash P \to Q \; \mathrm{true}}{\Gamma, P \; \mathrm{true} \vdash Q \; \mathrm{true}}

In type theory

In type theory

• a conditional statement is, under propositions-as-types a function type p→qp \to q (or the bracket type thereof).

• an entailment is a hypothetical judgement or sequent.

• function type

• hypothetical judgement

• linear implication

• contrapositive

−\phantom{-}symbol−\phantom{-}	−\phantom{-}in logic−\phantom{-}
A\phantom{A}∈\in	A\phantom{A}element relation
A\phantom{A}:\,:	A\phantom{A}typing relation
A\phantom{A}==	A\phantom{A}equality
A\phantom{A}⊢\vdashA\phantom{A}	A\phantom{A}entailment / sequentA\phantom{A}
A\phantom{A}⊤\topA\phantom{A}	A\phantom{A}true / topA\phantom{A}
A\phantom{A}⊥\botA\phantom{A}	A\phantom{A}false / bottomA\phantom{A}
A\phantom{A}⇒\Rightarrow	A\phantom{A}implication
A\phantom{A}⇔\Leftrightarrow	A\phantom{A}logical equivalence
A\phantom{A}¬\not	A\phantom{A}negation
A\phantom{A}≠\neq	A\phantom{A}negation of equality / apartnessA\phantom{A}
A\phantom{A}∉\notin	A\phantom{A}negation of element relation A\phantom{A}
A\phantom{A}¬¬\not \not	A\phantom{A}negation of negationA\phantom{A}
A\phantom{A}∃\exists	A\phantom{A}existential quantificationA\phantom{A}
A\phantom{A}∀\forall	A\phantom{A}universal quantificationA\phantom{A}
A\phantom{A}∧\wedge	A\phantom{A}logical conjunction
A\phantom{A}∨\vee	A\phantom{A}logical disjunction
symbol	in type theory (propositions as types)
A\phantom{A}→\to	A\phantom{A}function type (implication)
A\phantom{A}×\times	A\phantom{A}product type (conjunction)
A\phantom{A}++	A\phantom{A}sum type (disjunction)
A\phantom{A}00	A\phantom{A}empty type (false)
A\phantom{A}11	A\phantom{A}unit type (true)
A\phantom{A}==	A\phantom{A}identity type (equality)
A\phantom{A}≃\simeq	A\phantom{A}equivalence of types (logical equivalence)
A\phantom{A}∑\sum	A\phantom{A}dependent sum type (existential quantifier)
A\phantom{A}∏\prod	A\phantom{A}dependent product type (universal quantifier)
symbol	in linear logic
A\phantom{A}⊸\multimapA\phantom{A}	A\phantom{A}linear implicationA\phantom{A}
A\phantom{A}⊗\otimesA\phantom{A}	A\phantom{A}multiplicative conjunctionA\phantom{A}
A\phantom{A}⊕\oplusA\phantom{A}	A\phantom{A}additive disjunctionA\phantom{A}
A\phantom{A}&\&A\phantom{A}	A\phantom{A}additive conjunctionA\phantom{A}
A\phantom{A}⅋\invampA\phantom{A}	A\phantom{A}multiplicative disjunctionA\phantom{A}
A\phantom{A}!\;!A\phantom{A}	A\phantom{A}exponential conjunctionA\phantom{A}
A\phantom{A}?\;?A\phantom{A}	A\phantom{A}exponential disjunctionA\phantom{A}