List of mathematical logic topics
This is a list of mathematical logic topics, by Wikipedia page.For traditional syllogistic logic, see the list of topics in logic. Clicking on related changes shows a list of most-recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes.
| Table of contents |
|
2 Model theory 3 Set theory 4 Large cardinals 5 Recursion theory 6 Proof theory 7 Mathematical constructivism |
Working foundations
- Peano axioms
- Mathematical induction
- Naive set theory
- Universe (mathematics)
- Axiomatization
- Axiomatic system
- Mathematical proof
- Tautology
- Consistency
- Arithmetization of analysis
- Foundations of mathematics
- Generating arithmetic
- Formal language
- Giuseppe Peano
Model theory
- Functional predicate
- First-order predicate calculus
- Compactness theorem
- Löwenheim-Skolem theorem
- Soundness theorem
- Gödel's completeness theorem
- Gödel's incompleteness theorem
- Ultraproduct
- Non-standard analysis
- Second-order logic
- Whitehead problem
- Kurt Gödel
- Alfred Tarski
- Saharon Shelah
Set theory
- Axiomatic set theory
- Well-founded relation
- Transfinite number
- Ordinal number
- Cardinal number
- Cantor-Bernstein-Schroeder theorem
- Zermelo-Fraenkel axioms
- Zermelo set theory
- Class (set theory)
- Continuum hypothesis
- Forcing (mathematics)
- Freiling's Axiom of Symmetry
- Goodstein's theorem
- Gödel's constructible universe
- Hereditarily finite set
- Suslin hypothesis, Suslin's problem
- Ernst Zermelo
- Paul Cohen
Large cardinals
- Erdös cardinal
- Extendible cardinal
- Huge cardinal
- Inaccessible cardinal
- Ineffable cardinal
- Mahlo cardinal
- Measurable cardinal
- N-huge cardinal
- N-Mahlo cardinal
- Ramsey cardinal
- Rank-into-rank
- Strong cardinal
- Strongly inaccessible cardinal
- Subtle cardinal
- Supercompact cardinal
- Superstrong cardinal
- Totally indescribable cardinal
- Weakly compact cardinal
- Weakly inaccessible cardinal
- Woodin cardinal
Recursion theory
- Entscheidungsproblem
- Decision problem
- Church-Turing thesis
- Recursive function
- Kleene's recursion theorem
- Recursively enumerable set
- Decidable language
- Undecidable language
- Rice's theorem
- Effective results in number theory
- Diophantine set
- Matiyasevich's theorem
- Arithmetical hierarchy
- Subrecursion theory
- Hypercomputation
- Alonzo Church
- Emil Post
- Alan Turing
- Jacques Herbrand
- Haskell Curry
- Stephen Cole Kleene
Proof theory
- Metamathematics
- Sequent
- Sequent calculus
- Substructural logics
- Gerhard Gentzen
Mathematical constructivism