Propositions-as-types (BHK interpretation)

Layer 0 — Mathematicsin the Type Theory subtree

Brouwer-Heyting-Kolmogorov 1930s constructive interpretation: A and B = pair of proofs; A or B = tagged-union; forall = function; exists = dependent-pair; not A = A -> empty-type. Embedded in dependent-type theory.

Related concepts

Explore Propositions-as-types (BHK interpretation) on the interactive knowledge graph →