scrambled
Concept

Intuitionistic constructive logic

Modified just now
JourneyProgramming Language Theory Statuslearning Tags
  • formal system
  • logic
  • syntax grammar

\frac{A \quad B}{A \land B} & & (\land\text{-intro}) \\ \\

  • Inference rules

    • Conjunction

      ABAB(-intro)ABA(-elim1)ABB(-elim2)\begin{aligned} \frac{A \quad B}{A \land B} & & (\land\text{-intro}) \\ \\ \qquad \frac{A \land B}{A} & & (\land\text{-elim}_1) \\ \\ \qquad \frac{A \land B}{B} & & (\land\text{-elim}_2) \end{aligned}

    • Disjunction

      AAB(-intro1)BAB(-intro2)ABACBCC(-elim)\begin{aligned} \frac{A}{A \lor B} & & (\lor\text{-intro}_1) \\ \\ \frac{B}{A \lor B} & & (\lor\text{-intro}_2) \\\\ \frac{A \lor B \quad A \vdash C \quad B \vdash C}{C} & & (\lor\text{-elim}) \end{aligned}

    • Implication

      ABAB(-intro)ABAB(-elim)\begin{aligned} \frac{A \vdash B}{A \to B} & & (\to\text{-intro}) \\ \\ \frac{A \to B \quad A}{B} & & (\to\text{-elim}) \end{aligned}

    • Universal quantification

      P(x)x freshx.P(x)(-intro)x.P(x)P(t)(-elim)\begin{aligned} \frac{P(x) \quad x \text{ fresh}}{\forall x.\, P(x)} & & (\forall\text{-intro}) \\ \\ \frac{\forall x.\, P(x)}{P(t)} & & (\forall\text{-elim}) \end{aligned}

    • Existential quantification

      P(t)x.P(x)(-intro)x.P(x)P(y)Cy freshC(-elim)\begin{aligned} \frac{P(t)}{\exists x.\, P(x)} & & (\exists\text{-intro}) \\ \\ \frac{\exists x.\, P(x) \quad P(y) \vdash C \quad y \text{ fresh}}{C} & & (\exists\text{-elim}) \end{aligned}

    • Negation

      A¬A(¬-intro)A¬A(¬-elim)\begin{aligned} \frac{A \vdash \bot}{\neg A} & & (\neg\text{-intro}) \\ \\ \frac{A \quad \neg A}{\bot} & & (\neg\text{-elim}) \end{aligned}

    • Absurdity

      A(-elim) \frac{\bot}{A} \quad (\bot\text{-elim})

Pitfall. The rules define which derivations are valid. They say nothing about meaning-that is the role of an interpretation such as Brouwer-Heyting-Kolmogorov (BHK) interpretation.