EVOPEDIA

← 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.

aliasesMathematical logic and foundations
born atmid-19th century (1847)
born precisiondecade; origin contested
boundaryInside: 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 levelA 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).
scalesocial

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 paradigmaround 1940-1950 decade
mathematical logic's emergencemid-19th century date
Begriffsschrift1879 year
Russell's paradox1901 year
Hilbert's problems23 problems (1900)
completeness theorem1929 year
incompleteness theorems published1931 year
Entscheidungsproblem shown unsolvable (Church, Turing)1936 year
Löwenheim-Skolem theorem1919 year
areas of mathematical logic in the 1977 Handbook4 areas
Busy Beaver S(5)47,176,870 steps
five-state machines enumerated and decided181,385,789 machines
states of a machine whose non-halting ZFC cannot prove7,910 states (upper bound on the smallest n with BB(n) independent of ZFC)
Isabelle proof of both incompleteness theoremsunder 12,400 lines
first machine-assisted proof of the first incompleteness theorem1986 year (Shankar, Nqthm)
modal logic of forcing provable in ZFCS4.2 modal theory
articles in the deductive-reasoning meta-analysis38 articles
programming experience of participants in the logic/code study11 years (average)
syllogism accuracy by emotional context63 / 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.

Partners and parts published science

Built from / builds (9)

Sits inside / holds (2)

Trades with (valence) (15)

expressed by (23)

floor filled by (27)

represents (1)

Kinds (3)

Notes published science

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)

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. L5: Metatheorems: soundness, completeness, compactness and Löwenheim-Skolem tie derivation to truth; computability theory sorts what an effective procedure can decide (Turing degrees).
  6. 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).
  7. 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)

  1. L3: The formal system: language, axioms, rules; derivations and computations as formal objects.
  2. L4: Structures and models: where formulas are true or false; the universe of sets.
  3. L5: Metatheorems and computability: soundness, completeness, compactness, Löwenheim-Skolem; computable functions and Turing degrees.
  4. L6: Limits and foundations: incompleteness, undecidability, independence, consistency strength; foundational programmes and views (contested).
  5. L7: Use: formalised mathematics, proof assistants, applications in mathematics and computer science, teaching.

way in: Computation: machines run and classified

  1. L1: Machines enumerated and run: 181,385,789 five-state machines.
  2. 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

  1. L1: An emotional context present while reasoning (positive or negative pictures before a syllogism); disputes over intuitionism.
  2. 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

  1. L1: Spoken addresses: Hilbert's 1928 ICM lecture; papers first read aloud at meetings (Ferreirós at Madrid, Göttingen and Mainz).
  2. 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

  1. L1: Text drafted by a large language model.
  2. L2: Filled in by automated tools and held to formal oversight.

way in: Machine checker: proof scripts and kernels

  1. L1: Proof scripts: under 12,400 lines of Isabelle for both incompleteness theorems.
  2. 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

  1. L1: Results that strain intuition and expose gaps: Weierstrass's functions, Cantor's infinite sets, flaws in Euclid's axioms, the paradoxes.
  2. L2: Recognised as logical gaps and inconsistencies needing foundations.

way in: Sight: formulas, derivations and tables on page and screen

  1. L1: Formulas in a fixed formal language, written in symbols; Frege's notation left unused.
  2. 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

  1. L1: The community of logicians and its venues (the Association for Symbolic Logic's Bulletin).
  2. L2: Courses and textbooks settle what counts as the example of modern logic.

way in: The written record: papers, source books and classics

  1. L1: Published work: Begriffsschrift 1879, Principia 1910, Gödel 1931, Turing 1936.
  2. L2: Read and promoted, or left obscure until someone reads it.

way in: Thought: premises held and reasoned from

  1. L1: A premise or supposition held in mind; where it comes from is contested.
  2. 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

  1. L1: Program verification and model checking in software.
  2. 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

  1. L1: Structured scripts that can be examined interactively.
  2. L5: A metatheorem chosen for formal proof.

way out: Speech: addresses, lectures and courses

  1. L1: Spoken to an audience; slogans that travel ('No one shall expel us from the Paradise that Cantor has created').
  2. L6: Problems chosen for the century.

way out: Writing: papers, textbooks and source books

  1. L1: Papers and books in the record; a textbook for the layman (Carroll 1896).
  2. L7: A result chosen for publication.

Sources (23) published science

Mathematical logic (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01)
Mathematics (encyclopedia article, WME snapshot 2026-11-01)
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)
Ferreirós, J. (2001) The road to modern logic: an interpretation. Bulletin of Symbolic Logic 7(4):441-484, doi:10.2307/2687794 (open copy, Universidad de Sevilla repository idus 11441/38373) (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)
Entscheidungsproblem (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Continuum hypothesis (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)
Wang, L., Zhang, M., Zou, F., Wu, X., Wang, Y. (2020) Deductive-reasoning brain networks: a coordinate-based meta-analysis of the neural signatures in deductive reasoning. Brain and Behavior 10(12):e01853 (open access) (behind its links)
Liu, Kim, Wilson & Bedny, Computer code comprehension shares neural resources with formal logical inference in the fronto-parietal network, eLife 9:e59340 (2020), doi:10.7554/eLife.59340, CC BY (behind its links)
Smith, K. W., Vartanian, O., Goel, V. (2014) Dissociable neural systems underwrite logical reasoning in the context of induced emotions with positive and negative valence. Front. Hum. Neurosci. 8:736 (open access) (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)
Computability theory (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (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)
Zach R (2025) Sets, Logic, Computation: An Open Introduction to Metalogic (Open Logic Project, Fall 2025, revision 6178f32; CC BY 4.0). Chapters 1 (Sets), 3 (Functions), 4 (The Size of Sets), 14 (Turing Machine Computations) (behind its links)
Avigad, Mathematics and the formal turn (arXiv 2311.00007v2, 2023) (behind its links)
Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. 2-42 (1936-37), doi:10.1112/plms/s2-42.1.230 (open copy, OCR text) (behind its links)