← all systems · see it in The System
Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on
Mathematical logic is the study of logic within mathematics. This is commonly done by means of formal systems called formal logics that define rules of reasoning and the axioms they satisfy.
Properties published scienceour proposal
Sourced fields, and our own readings.
| aliases | Mathematical logic and foundations |
| born at | mid-19th century (1847) |
| born precision | decade; origin contested |
| boundary | Inside: the practice of mathematical logic (logicians, their formal languages, deduction systems, models, metatheorems, limit results, journals, textbooks and proof assistants) and the structures it works on (formal theories, derivations, structures and models, sets, computable functions and Turing degrees). Outside: the rest of mathematics it founds and is applied to, philosophical and informal logic (the sibling walk sys:logic), computer science, which shares computability with a different emphasis, and the people and machines that carry it. |
| nested level | A subfield of mathematics (rung 11) and the discipline that resolved its foundational crisis; built from four subareas; runs on logicians, writing and, since 1986 for machine-checked metatheorems, on proof assistants; feeds computer science (Curry-Howard, model checking, descriptive complexity). |
| scale | social |
Measures (24) published science
| characteristic clock: Entscheidungsproblem posed (1928) to shown unsolvable (1936) | 8 years (derived from two dates the source gives) |
| characteristic clock: continuum hypothesis posed (1900) to shown independent (1963) | 63 years (derived from two dates) |
| Hilbert's tenth problem posed (1900) to unsolvable (Matiyasevich 1970) | 70 years (derived) |
| time for FOL to become the paradigm | around 1940-1950 decade |
| mathematical logic's emergence | mid-19th century date |
| Begriffsschrift | 1879 year |
| Russell's paradox | 1901 year |
| Hilbert's problems | 23 problems (1900) |
| completeness theorem | 1929 year |
| incompleteness theorems published | 1931 year |
| Entscheidungsproblem shown unsolvable (Church, Turing) | 1936 year |
| Löwenheim-Skolem theorem | 1919 year |
| areas of mathematical logic in the 1977 Handbook | 4 areas |
| Busy Beaver S(5) | 47,176,870 steps |
| five-state machines enumerated and decided | 181,385,789 machines |
| states of a machine whose non-halting ZFC cannot prove | 7,910 states (upper bound on the smallest n with BB(n) independent of ZFC) |
| Isabelle proof of both incompleteness theorems | under 12,400 lines |
| first machine-assisted proof of the first incompleteness theorem | 1986 year (Shankar, Nqthm) |
| modal logic of forcing provable in ZFC | S4.2 modal theory |
| articles in the deductive-reasoning meta-analysis | 38 articles |
| programming experience of participants in the logic/code study | 11 years (average) |
| syllogism accuracy by emotional context | 63 / 64 / 70 % (positive / negative / neutral) |
| minimum entropy cost of a logically irreversible bit operation (as the objection states the bound) | kT ln 2 energy |
| last new Busy Beaver value before S(5) | over 40 years |
Open contentions (11) open contention
Where sources or readings disagree. Both stay on the map.
- C-413 Where do thoughts come from?
booked: No theory is proven, so the map lists the main ones side by side and doesn't pick one. It shows where thinking is handled in the brain, not where thoughts start.
the other reading: positions as listed in research/CONTENTIONS.md C-413 - C-557 Can every computation be done by a Turing machine?
booked: The map follows the near-universal acceptance of the Church-Turing thesis and notes that it can't be proven, keeping the challenges alongside.
the other reading: physical and complexity variants of the thesis (not due to Church or Turing) - C-1493 Is the continuum hypothesis true or false?
booked: The map books it as unprovable either way from the standard axioms, and keeps the views that an answer is still to be found and that there is none to find.
the other reading: new axioms may resolve it (Woodin); settled on the multiverse view by how it behaves across universes (Hamkins) - C-1516 Is set theory the foundation of mathematics?
booked: The map books it as the usual foundation, and keeps category theory, type theory and constructive mathematics as rivals.
the other reading: category theory as a foundation independent of set theory (Mac Lane); NBG, MK, NF - C-2349 Is mathematics discovered or invented?
booked: The map keeps the schools side by side.
the other reading: constructivism (Kronecker, Brouwer); formalism (Hilbert); logicism (Frege, Russell) - C-2411 Is first-order logic a natural unity?
booked: The map keeps both views.
the other reading: higher-order logic as the proper logic of mathematics (Frege, Russell, Hilbert, Church, per Ferreirós) - C-2413 Does Gödel's theorem show minds aren't machines?
booked: The map keeps the argument and its critics.
the other reading: Lucas and Penrose: minds see truths no machine can (as the encyclopedia reports them); Putnam: the theorems may apply to the human faculty of mathematics, if consistent; Paulson citing Franzén: such uses are fallacies; Hofstadter: Gödel's self-reference as a 'strange loop' like the one he says gives rise to the sense of 'I' - C-2414 Was Hilbert's second problem solved?
booked: The map keeps the readings side by side.
the other reading: not all mathematicians agree; the status of Hilbert's second problem 'is not yet decided'; Gentzen's consistency proof with transfinite induction as a partial resolution - C-2428 When did mathematical logic begin?
booked: The map keeps the competing starts.
the other reading: Frege's Begriffsschrift (1879) as the turning point; Leibniz and Lambert's isolated 18th-century attempts; logic itself many centuries older and many-cultured (China, India, Greece, the Islamic world; the sibling walk sys:logic) - C-2437 Is there one universe of sets or many?
booked: The map keeps both views.
the other reading: Woodin's programme: new axioms may settle CH in one universe - C-2448 Does the Turing degrees structure have automorphisms?
booked: The map keeps the problem open.
the other reading: Cooper claims to have constructed one; the construction 'has not been verified' and some colleagues believe it contains errors
Partners and parts published science
Built from / builds (9)
- Set theory: the study of sets (collections taken as single objects), membership, Cantor's infinities and the axioms, and the practice of the people and machines who work with them
- Proof assistant (Metamath, Lean, Isabelle and the like)
- Computability theory
- Derivation systems (axiomatic, natural deduction, sequent calculus, tableaux, resolution)
- Proof theory
- Model theory
- First-order logic (the dominant formal system)
- Competition for the place of 'the' logic of mathematics (first-order against higher-order and type theory)
- Competition between traditional (Aristotelian) logic and the new mathematical logic
Sits inside / holds (2)
Trades with (valence) (15)
- Logic: the study and practice of correct reasoning (formal and informal, across its traditions) and the valid inference it works on, together with how people actually reason via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Human (Homo sapiens) via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Large language model via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Human brain via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Shapes (geometry): the practice and the structure via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Mathematics (the field: the practice and the structures it studies) via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Arithmetic (the practice of calculating, and the operations and laws it works with) via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Computer via sys:thermal-energy · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on even
- Turing machine: the abstract machine that reads and writes one symbol at a time on an unbounded tape by a finite table of rules, the model of computation of logic and computer science via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Programming language via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Set theory: the study of sets (collections taken as single objects), membership, Cantor's infinities and the axioms, and the practice of the people and machines who work with them via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Proof assistant (Metamath, Lean, Isabelle and the like) via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Computer science (the field: the practice and the computation it studies) via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Mathematical proof: the practice of showing that a statement follows from axioms and earlier theorems, how it is written, checked (by people and machines) and accepted, and the derivations it works on via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on gain
- Philosophy (the field: the practice and the questions it works on) via sys:written-record · Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on mixed
expressed by (23)
- Generation/Synthesis
- Scaffolding/Enablement (Meta-Tooling)
- Templating / Standardization
- Quality Improvement/Refinement
- Interoperability/Transduction (Bridging)
- Encapsulation & Modularity (Abstraction)
- Symbiosis/Co-Creation (Collaborative Specialization)
- Sensing/Scanning
- Hypothesis/Goal Selection
- Search/Foraging
- Uncertainty Reduction/Learning
- Multi-Scale Data Fusion / Triangulation
- Trail-Marking / Externalized Memory (Stigmergy)
- Surprise / Change-Point Detection
- Hypothesis Portfolio / Multiple Hypothesis Tracking
- Social Learning / Public Information Use
- Reactive Response
- Physical/Virtual Barrier
- Self-Monitoring
- Validation of Effectiveness
- Resilience & Repair
- Redundancy & Diversity
- Quality Control & Error Correction
floor filled by (27)
- Logic: the study and practice of correct reasoning (formal and informal, across its traditions) and the valid inference it works on, together with how people actually reason
- Acoustic wave (sound: pressure waves in matter)
- Human (Homo sapiens)
- Writing (the practice of marking language on a surface, and the script plus rules it works with)
- Large language model
- Human brain
- Mathematics (the field: the practice and the structures it studies)
- Turing machine: the abstract machine that reads and writes one symbol at a time on an unbounded tape by a finite table of rules, the model of computation of logic and computer science
- Lambda calculus
- Set theory: the study of sets (collections taken as single objects), membership, Cantor's infinities and the axioms, and the practice of the people and machines who work with them
- Proof assistant (Metamath, Lean, Isabelle and the like)
- Halting problem
- Philosophiae Naturalis Principia Mathematica
- Computer science (the field: the practice and the computation it studies)
- Computability theory
- Derivation systems (axiomatic, natural deduction, sequent calculus, tableaux, resolution)
- Hilbert's program
- Proof theory
- Foundations of mathematics
- Model theory
- First-order logic (the dominant formal system)
- Gödel's incompleteness theorems
- Gödel's completeness theorem
- Compactness theorem
- Löwenheim-Skolem theorem
- Forcing (mathematics)
- Begriffsschrift
represents (1)
Kinds (3)
- Mathematics (the field: the practice and the structures it studies)
- Logic: the study and practice of correct reasoning (formal and informal, across its traditions) and the valid inference it works on, together with how people actually reason
- Category-theoretic foundations (categorical logic, toposes)
Notes published science
- In set theory's forcing there are 'switches' and 'buttons': the continuum hypothesis is a switch you can turn on or off at will by forcing, but a button, once pushed, can never be unpushed; the principles of forcing that ZFC can prove are exactly one modal logic, S4.2 (src:hamkins-loewe-2007).
- In 1990 Allen Brady predicted 'It will never be proved' that the fifth Busy Beaver value is 47,176,870; a massive online collaboration proved exactly that in the Coq proof assistant, deciding all 181,385,789 five-state machines (src:bbchallenge-2025).
- When Lawrence Paulson machine-checked Gödel's second incompleteness theorem he found that 'most published proofs contain substantial gaps' - the theorem about the limits of proof had itself rarely been proved in full (src:paulson-incompleteness).
Layers
The ways it takes in its world, where they meet, and how it acts back, each from L1 (where it meets the world) up.
mathematical logic as logicians describe it: formulas and proofs written in formal languages, derived by rules, interpreted in structures, related by metatheorems, bounded by limit results, and used across mathematics and computing (reader's view)
- L1: Marks: formulas, derivations and machine tables written as symbols on paper, blackboard and screen; formal proof scripts in files; Frege's two-dimensional notation the one that did not take.
- L2: Taking it in: a reader parses well-formed formulas (a fronto-parietal network that overlaps with code comprehension), a kernel or parser reads a proof script, a language model drafts text in a checker's language.
- L3: The formal system: a language, axioms and rules of inference; derivations as formal objects (Hilbert systems, natural deduction, sequent calculus); computations by machine tables and recursive definitions.
- L4: Structures and models: a domain with interpretations in which sentences are true or false; set theory's universe of sets as the place all structures live.
- L5: Metatheorems: soundness, completeness, compactness and Löwenheim-Skolem tie derivation to truth; computability theory sorts what an effective procedure can decide (Turing degrees).
- L6: Limits and foundations: incompleteness, undecidability and independence (CH, choice), consistency strength (large cardinals), and the foundational programmes and views they bound (Hilbert's program, intuitionism, universe and multiverse).
- L7: Use: formalised mathematics and proof assistants, model-theoretic proofs in geometry (Mordell-Lang), computer science (Curry-Howard, model checking, Fagin's theorem), applications from physics to law, textbooks and courses.
the boardroom (shared floors)
- L3: The formal system: language, axioms, rules; derivations and computations as formal objects.
- L4: Structures and models: where formulas are true or false; the universe of sets.
- L5: Metatheorems and computability: soundness, completeness, compactness, Löwenheim-Skolem; computable functions and Turing degrees.
- L6: Limits and foundations: incompleteness, undecidability, independence, consistency strength; foundational programmes and views (contested).
- L7: Use: formalised mathematics, proof assistants, applications in mathematics and computer science, teaching.
way in: Computation: machines run and classified
- L1: Machines enumerated and run: 181,385,789 five-state machines.
- L2: Deciders sort halting from non-halting machines without running them to the end; holdouts go to people.
way in: Emotion: valenced context and the heat of disputes
- L1: An emotional context present while reasoning (positive or negative pictures before a syllogism); disputes over intuitionism.
- L2: Dissociable neural patterns during reasoning under positive and negative valence; accuracy 63% and 64% against 70% neutral.
way in: Hearing: lectures, addresses and problem lists
- L1: Spoken addresses: Hilbert's 1928 ICM lecture; papers first read aloud at meetings (Ferreirós at Madrid, Göttingen and Mainz).
- L2: Problems heard and taken up: the 1900 list and the 1928 Entscheidungsproblem set the direction of work.
way in: Language model: drafted proof outlines
- L1: Text drafted by a large language model.
- L2: Filled in by automated tools and held to formal oversight.
way in: Machine checker: proof scripts and kernels
- L1: Proof scripts: under 12,400 lines of Isabelle for both incompleteness theorems.
- L2: The checker reads every inference; gaps and errors in the literature surface.
way in: Mathematics: gaps, paradoxes and open problems arriving from the rest of the field
- L1: Results that strain intuition and expose gaps: Weierstrass's functions, Cantor's infinite sets, flaws in Euclid's axioms, the paradoxes.
- L2: Recognised as logical gaps and inconsistencies needing foundations.
way in: Sight: formulas, derivations and tables on page and screen
- L1: Formulas in a fixed formal language, written in symbols; Frege's notation left unused.
- L2: Reading formal logic: parietal and anterior prefrontal areas, more anterior and extensive in prefrontal cortex than for math.
way in: The community of logicians: agreement on exemplars
- L1: The community of logicians and its venues (the Association for Symbolic Logic's Bulletin).
- L2: Courses and textbooks settle what counts as the example of modern logic.
way in: The written record: papers, source books and classics
- L1: Published work: Begriffsschrift 1879, Principia 1910, Gödel 1931, Turing 1936.
- L2: Read and promoted, or left obscure until someone reads it.
way in: Thought: premises held and reasoned from
- L1: A premise or supposition held in mind; where it comes from is contested.
- L2: Deduction in stages: decoding linguistic information, converting and correcting rules, turning inferences into conclusions; a cingulo-opercular hub (IFG, insula, cingulate); parallel steps feeding a slow serial system.
way out: Applying: tools handed to mathematics and computing
- L1: Program verification and model checking in software.
- L7: Methods carried into other fields: model theory into diophantine geometry; descriptive complexity into computer science.
way out: Formalising: proof scripts sent to a checker
- L1: Structured scripts that can be examined interactively.
- L5: A metatheorem chosen for formal proof.
way out: Speech: addresses, lectures and courses
- L1: Spoken to an audience; slogans that travel ('No one shall expel us from the Paradise that Cantor has created').
- L6: Problems chosen for the century.
way out: Writing: papers, textbooks and source books
- L1: Papers and books in the record; a textbook for the layman (Carroll 1896).
- L7: A result chosen for publication.
Sources (23) published science
Paulson, L. C. A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle. Journal of Automated Reasoning; arXiv:2104.13792 (behind its links)
The bbchallenge Collaboration (2025, v2 2026) Determination of the fifth Busy Beaver value. arXiv:2509.12337 (behind its links)
Foundations of mathematics (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Logic (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Gödel's incompleteness theorems (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Gödel's completeness theorem (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Yedidia, A. & Aaronson, S. (2016) A relatively small Turing machine whose behavior is independent of set theory. arXiv:1605.04343 (behind its links)
Hamkins, J. D. & Löwe, B. (2008) The modal logic of forcing. Trans. Amer. Math. Soc. 360(4):1793-1817, doi:10.1090/s0002-9947-07-04297-3. arXiv:math/0509616 (behind its links)
Bennett CH (2003) Notes on Landauer's principle, reversible computation, and Maxwell's Demon. Stud Hist Philos Mod Phys 34:501-510. arXiv:physics/0210005 (behind its links)
Proof theory (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Model theory (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Avigad, Mathematics and the formal turn (arXiv 2311.00007v2, 2023) (behind its links)