Mathematical logic and foundations Concept
Inductive type
Builds on Type theoryMathematical inductionLeast fixed point
Summary
An inductive type is a type given by a list of constructors. Its elements are exactly the values built by finitely many uses of these constructors. The natural numbers, with the constructors zero and successor, are the basic example; lists and trees are others. Each inductive type comes with a principle of recursion and of induction that defines functions and proves statements by cases on the constructors. Inductive types are the main way to introduce data in type theories such as Martin-Löf type theory and the calculus of inductive constructions.
Reading path
To understand this page from the ground up, read these 22 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Least fixed point concept
- Mathematical induction concept
- Proposition concept
- Set concept
- Set definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Biconditional definition
- Truth table concept
- Modus ponens concept
- Mathematical proof concept
- Propositional logic concept
- Tautology definition
- Logical equivalence definition
- Double negation law statement
- Proof by contradiction concept
- Russell's paradox statement
- Type theory concept
- Inductive type concept
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | Q80JWCWNKX |
|---|---|
| URI | m2://Q80JWCWNKX |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B38, 68N15 |
| Uses | Type theory, Mathematical induction, Least fixed point |
| Same as | |
| Changed | 3 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.