Skip to content
scrambled
Programming Language Theory Concept

Intuitionistic/Constructive logic

JourneyProgramming Language Theory Statuslearning Tags
  • formal system
  • logic
  • syntax grammar

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

  • Inference rules

    • Conjunction

      ABA∧B(∧-intro)A∧BA(∧-elim1)A∧BB(∧-elim2)
    • Disjunction

      AA∨B(∨-intro1)BA∨B(∨-intro2)A∨BA⊢CB⊢CC(∨-elim)
    • Implication

      A⊢BA→B(→-intro)A→BAB(→-elim)
    • Universal quantification

      P(x)x fresh∀x.P(x)(∀-intro)∀x.P(x)P(t)(∀-elim)
    • Existential quantification

      P(t)∃x.P(x)(∃-intro)∃x.P(x)P(y)⊢Cy freshC(∃-elim)
    • Negation

      A⊢⊥¬A(¬-intro)A¬A⊥(¬-elim)
    • Absurdity

      ⊥A(⊥-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.