nLab Metamath

Contents

Context

Constructivism, Realizability, Computability

Type theory

natural deduction metalanguage, practical foundations

judgement
hypothetical judgement, sequent
- antecedents $\vdash$ consequent, succedents

type theory (dependent, intensional, observational type theory, homotopy type theory)

calculus of constructions

syntax object language

theory, axiom
proposition/type (propositions as types)
definition/proof/program (proofs as programs)
theorem

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logic	set theory (internal logic of)	category theory	type theory
proposition	set	object	type
predicate	family of sets	display morphism	dependent type
proof	element	generalized element	term/program
cut rule		composition of classifying morphisms / pullback of display maps	substitution
introduction rule for implication		counit for hom-tensor adjunction	lambda
elimination rule for implication		unit for hom-tensor adjunction	application
cut elimination for implication		one of the zigzag identities for hom-tensor adjunction	beta reduction
identity elimination for implication		the other zigzag identity for hom-tensor adjunction	eta conversion
true	singleton	terminal object/(-2)-truncated object	h-level 0-type/unit type
false	empty set	initial object	empty type
proposition, truth value	subsingleton	subterminal object/(-1)-truncated object	h-proposition, mere proposition
logical conjunction	cartesian product	product	product type
disjunction	disjoint union (support of)	coproduct ((-1)-truncation of)	sum type (bracket type of)
implication	function set (into subsingleton)	internal hom (into subterminal object)	function type (into h-proposition)
negation	function set into empty set	internal hom into initial object	function type into empty type
universal quantification	indexed cartesian product (of family of subsingletons)	dependent product (of family of subterminal objects)	dependent product type (of family of h-propositions)
existential quantification	indexed disjoint union (support of)	dependent sum ((-1)-truncation of)	dependent sum type (bracket type of)
logical equivalence	bijection set	object of isomorphisms	equivalence type
	support set	support object/(-1)-truncation	propositional truncation/bracket type
		n-image of morphism into terminal object/n-truncation	n-truncation modality
equality	diagonal function/diagonal subset/diagonal relation	path space object	identity type/path type
completely presented set	set	discrete object/0-truncated object	h-level 2-type/set/h-set
set	set with equivalence relation	internal 0-groupoid	Bishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
	equivalence class/quotient set	quotient	quotient type
induction		colimit	inductive type, W-type, M-type
higher induction		higher colimit	higher inductive type
-		0-truncated higher colimit	quotient inductive type
coinduction		limit	coinductive type
	preset		type without identity types
	set of truth values	subobject classifier	type of propositions
domain of discourse	universe	object classifier	type universe
modality		closure operator, (idempotent) monad	modal type theory, monad (in computer science)
linear logic		(symmetric, closed) monoidal category	linear type theory/quantum computation
proof net		string diagram	quantum circuit
(absence of) contraction rule		(absence of) diagonal	no-cloning theorem
		synthetic mathematics	domain specific embedded programming language

homotopy levels

semantics

Edit this sidebar

Idea
Related entries
References

Idea

Metamath is a proof assistant for creating databases of formally verified proofs. The proof language is extremely parsimonious, using textual substitution as its only rule of inference (augmented by distinct variable constraints so that unfortunate variable captures can be prohibited).

One consequence of this philosophy is that the proof verifier itself treats definitions, syntax and axioms all as axioms. To avoid inadvertently introducing ambiguities or contradictions there is a separate tool called the definition checker, which implements a set of rules which are more complicated than the simple substitution rule of the verifier, and which is only applicable for proof databases similar to the set theory ones widely used.

Metamath proof verifiers can be very small and simple, so many have been implemented in a wide variety of computer languages. Perhaps the most interesting was created by Stephen O’Rear using a language that makes Turing machines optimised for few states. This was used to reduce the bound of the smallest Busy Beaver Number that ZFC cannot prove to exist. A side effect was a small Turing machine that halts iff the Riemann Hypothesis is False (and gives the smallest counterexample)

Related entries

proof assistants:

based on plain type theory/set theory:

Metamath
Mizar, NuPRL, Isabelle, HOL

based on dependent type theory/homotopy type theory:

Coq, Agda, Lean, Arend

based on cubical type theory:

cubicaltt
redtt
yacctt
RedPRL
Cubical Agda
- library and demos
- 1lab (cross-linked reference resource)

based on modal type theory:

Agda-flat: installation instructions

based on simplicial type theory:

For monoidal category theory:

DisCoPy

For higher category theory:

projects for formalization of mathematics with proof assistants:

Archive of Formal Proofs (using Isabelle)
ForMath project (using Coq)
MathScheme
UniMath project (using Coq and Agda)
Xena project (using Lean)

Other proof assistants

Andromeda

Historical projects that died out:

The QED Project

References

Metamath was originally designed by Norman Megill, but many people have contributed over the years.

Metamath home page

There are several Metamath databases on the Metamath website. The most developed covers classical ZFC set theory, but there is a very nice NF set theory database and a couple of other less well developed ones.