Mathematical logic and foundations Constructive mathematics Concept
Type theory
Builds on Russell's paradoxSet
Summary
A type theory is a formal system in which every term has a type. Its rules say which terms can be formed in which types. Russell introduced a theory of types to avoid Russell's paradox, by forbidding a collection to contain objects of its own level. Church's simple type theory of 1940 and Martin-Löf's intuitionistic type theory are the main later systems. Type theories serve as foundations of mathematics alternative to set theory, and as the basis of programming languages and proof assistants.
Reading path
To understand this page from the ground up, read these 19 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set concept
- Set definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Biconditional definition
- Truth table concept
- Modus ponens concept
- Propositional logic concept
- Mathematical proof concept
- Tautology definition
- Logical equivalence definition
- Double negation law statement
- Proof by contradiction concept
- Russell's paradox statement
- Type theory concept
Where this leads
4 pages build on this one.
Further reading
About this page
| Tag | Q48KGV33AH |
|---|---|
| URI | m2://Q48KGV33AH |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B38, 03B16 |
| Uses | Russell's paradox, Set |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.