← all systems · see it in The System
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
A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion.
Properties published scienceour proposal
Sourced fields, and our own readings.
| born at | 6th century BCE (Thales, 624-546 BCE) |
| born precision | century; origin contested |
| boundary | Inside: the practice of stating, proving, checking and accepting mathematical statements (methods of proof, the standard of rigour, refereeing, formal derivation systems, proof assistants and their kernels, the community's acceptance) and the structure it works on (derivations from axioms by rules of inference). Outside: the mathematics proved (number, geometry, set theory as fields), the logic whose systems proofs are written in (studied as a field of its own), the computers and people that carry proofs, and empirical or statistical arguments, which are distinguished from proof. |
| nested level | A part of mathematics (the way its statements become theorems) and an object of mathematical logic (proof theory). Runs on people (mathematicians, referees, students), on writing (papers, books) and, since 1967, on proof checkers and computers. |
| scale | social |
Measures (28) published science
| characteristic clock: four colour conjecture to proof (1852 to 1976) | 124 years (derived from two dates the source gives) |
| characteristic clock: time a false proof stood (Kempe 1879 to Heawood 1890; Tait 1880 to Petersen 1891) | 11 years |
| wait from Kepler proof (1998) to its publication (2006) | 8 years (derived from two dates the source gives) |
| Flyspeck formalisation (announced January 2003, completed 2014) | about 11 years |
| CPU time for the hardest Flyspeck subclaim | about 5000 CPU hours |
| time to check the formal Kepler main statement | about 5 hours (scripts); about 40 minutes (recorded proof) on a 2 GHz CPU |
| nonlinear inequalities in the Kepler proof | nearly a thousand inequalities |
| cases in the first four colour proof (proof by exhaustion) | 1,936 cases |
| reducible configurations after Robertson, Sanders, Seymour and Thomas (1997) | 633 configurations |
| referees' certainty in the Kepler proof | 99 percent (as stated by referees) |
| HOL Light kernel size | about 400 lines of code |
| HOL Light primitive inference rules | 10 rules, 3 axioms count |
| share of library theorems proved by fully automated procedures (Mizar) | 40 (Mizar); 47 (HOL Light/Flyspeck) percent |
| Logic Theorist theorems proved of Principia's first 52 | 38 theorems (1956) |
| Odd Order proof length; quasi-thin classification length | 255; 1221 pages |
| mathlib size growth 2017-2019 | 15k to 140k lines of code |
| mathlib contributors (2019) | 73 contributors, 11 maintainers people |
| mathlib theorems (May 2025) | over 210,000 theorems, 100,000 definitions count |
| Metamath set.mm library | about 23,000 theorems, 600k lines count |
| Mizar library | over 3.1 million lines of code |
| size of the Boolean Pythagorean triples proof | about 200 TB |
| refereeing time for a machine-assisted proof | 7 years (not completely refereed); 3 years (another) |
| expansion from conversation to talk to paper | minutes; an hour talk; a 15-20 page paper read in hours or days time and length (Thurston's estimate) |
| Thurston notes mailing list | about 1200 people |
| mathematicians scanned for beauty; equations rated | 15; 60 count |
| length of math demonstrations followed in EEG | 13-68 seconds |
| Fermat's Last Theorem Lean formalisation reported (2026) | eleven days; about 13 million lines; roughly 30,000 intermediate theorems as reported by the encyclopedia |
| Proofs from THE BOOK (2003) | 32 proofs |
Open contentions (6) 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: see C-413 - C-2328 Is a computer-checked proof a real proof?
booked: The map keeps both views.
the other reading: not proofs in the full sense because no human can check them (initial four colour reception; 'Is this still maths?'); machine-checked proofs more reliable 'by orders of magnitude' than peer review and need no referee (Hales et al. 2017; Gowers via Avigad 2023); formal proofs 'out of reach and mostly irrelevant' next to human processes (Thurston 1994, before the large formalisations) - C-2344 Can every published proof be turned into a formal one?
booked: The map keeps the belief and the evidence against it.
the other reading: formalisation regularly finds errors (hundreds in the Kepler proof; a nontrivial repair in Shchur's bound), so the conversion is not routine; making formalisations compatible would mean rewriting 'all old mathematical papers whose results we depend on' (Thurston 1994) - C-2380 Can probabilistic evidence count as proof?
booked: The map keeps both positions.
the other reading: some probabilistic evidence (Rabin's primality test) is 'as good as genuine mathematical proofs' (a few mathematicians and philosophers) - C-2381 Where and when did proof begin?
booked: The map keeps the competing starts.
the other reading: Babylonian geometry tablets contain a simple proof that the square root of two is irrational (Altschuler and Altschuler 2016, preprint; 'It is not known, as yet, if the Babylonians appreciated that these tablets indeed contained this proof'); plausibility arguments with pictures and analogies came first; demonstration 'likely' first arose in geometry from land measurement; proof traditions in other cultures ('folk mathematics, oral traditions ... in other cultures'), not walked here - C-2382 What is a proof for?
booked: The map keeps both purposes.
the other reading: the task is to seek a deductive pathway from axioms to propositions (the 'popular model' Thurston names); what mathematicians produce is human understanding; proofs are one channel for it (Thurston 1994); proofs should be paired with formal proofs whenever feasible (Benzmüller 2019)
Partners and parts published science
Built from / builds (11)
- Mathematics (the field: the practice and the structures it studies)
- Peer review
- Proof assistant (Metamath, Lean, Isabelle and the like)
- The mathematical community and its subfields
- Axioms (the starting assumptions)
- Rules of inference
- Theorems (proved statements, reused as steps)
- Conjectures (statements awaiting proof)
- Derivation systems (axiomatic, natural deduction, sequent calculus, tableaux, resolution)
- Formal libraries (mathlib, Mizar, Metamath, Archive of Formal Proofs)
- Competition for the authority to certify a proof (human refereeing against machine checking)
Sits inside / holds (3)
- Human society (from local community up to societies)
- 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
Trades with (valence) (24)
- Real number (the practice of measuring the continuum, and the complete ordered field) via sys:sensory-environment · 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 gain
- Recursion: defining or computing a thing in terms of smaller versions of itself, as computer science and mathematics describe it, with its base cases, call stack, recursive data, induction, and its sightings in language and nature via sys:written-record · 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 gain
- Mathematics (the field: the practice and the structures it studies) via sys:written-record · 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 gain
- Limit (mathematics): the value a sequence or function approaches, and the practice of approaching, bounding and proving it via sys:sensory-environment · 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 gain
- Argument: premises offered in support of a conclusion, and argumentation, the practice of giving and asking for reasons in doubt or disagreement, as philosophy and argumentation theory describe them via sys:language · 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 gain
- 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 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 gain
- Human (Homo sapiens) via sys:written-record · 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 gain
- Science (as a human social and cultural system) via sys:written-record · 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 mixed
- Writing (the practice of marking language on a surface, and the script plus rules it works with) via sys:written-record · 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 gain
- Large language model via sys:written-record · 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 gain
- LLM-based agent via sys:written-record · 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 mixed
- Human brain via sys:written-record · 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 gain
- Shapes (geometry): the practice and the structure via sys:written-record · 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 gain
- Computer via sys:written-record · 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 gain
- 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 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 mixed
- Artificial intelligence via sys:written-record · 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 mixed
- 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 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 gain
- Proof assistant (Metamath, Lean, Isabelle and the like) via sys:written-record · 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 gain
- History of science (the field and the story it tells) via sys:written-record · 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 gain
- Computer science (the field: the practice and the computation it studies) via sys:written-record · 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 gain
- 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 via sys:written-record · 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 gain
- Graph theory: the practice of studying vertices joined by edges (problems, proofs, algorithms, its people and books) and the graphs it works on via sys:written-record · 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 gain
- Prime numbers (the practice of number theory that finds, proves and uses them, and the structure of the primes it works on) via sys:sensory-environment · 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 gain
- Truth via sys:written-record · 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 mixed
expressed by (26)
- Generation/Synthesis
- Recombination/Composition
- Scaffolding/Enablement (Meta-Tooling)
- Templating / Standardization
- Quality Improvement/Refinement
- Interoperability/Transduction (Bridging)
- Encapsulation & Modularity (Abstraction)
- Amplification/Scale-Up (Manufacture & Distribution)
- Symbiosis/Co-Creation (Collaborative Specialization)
- Evolvability/Plasticity Engineering (Design for Future Variation)
- Distributed Autonomy/Decentralized Execution (Subsidiarity)
- Sensing/Scanning
- Hypothesis/Goal Selection
- Search/Foraging
- Navigation/Pathfinding
- Uncertainty Reduction/Learning
- Multi-Scale Data Fusion / Triangulation
- Trail-Marking / Externalized Memory (Stigmergy)
- 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 (23)
- Mathematics (the field: the practice and the structures it studies)
- Limit (mathematics): the value a sequence or function approaches, and the practice of approaching, bounding and proving it
- 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)
- Peer review
- Human brain
- Euclid's Elements
- Computer
- 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
- 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)
- The mathematical community and its subfields
- Axioms (the starting assumptions)
- Rules of inference
- Conjectures (statements awaiting proof)
- Formal libraries (mathlib, Mizar, Metamath, Archive of Formal Proofs)
- Gödel's incompleteness theorems
- Automated theorem proving
- Formal verification (hardware and software)
- Graph theory: the practice of studying vertices joined by edges (problems, proofs, algorithms, its people and books) and the graphs it works on
- Prime numbers (the practice of number theory that finds, proves and uses them, and the structure of the primes it works on)
- Truth
represents (1)
Kinds (15)
- Direct proof
- Proof by mathematical induction
- Proof by contraposition
- Proof by contradiction (reductio ad absurdum)
- Proof by construction
- Proof by exhaustion
- Probabilistic proof (the probabilistic method)
- Combinatorial proof
- Nonconstructive proof
- Computer-assisted proof
- Formal proof
- Visual proof
- Two-column proof
- Zero-knowledge proof
- Probabilistically checkable proof
Notes published science
- The first famous wrong proof of the four colour theorem (Kempe, 1879) was 'widely acclaimed' and stood unchallenged for 11 years before Heawood found the flaw in 1890; the theorem then waited until 1976 and a computer (src:wp:four-color-theorem).
- The trusted heart of the HOL Light proof checker is about 400 lines of code, and every theorem, however long, has to pass through it; the hardest piece of the formal Kepler proof still took about 5000 CPU hours to check (src:hales-2014, src:hales-2017-flyspeck).
- Mathematical beauty lights up the same patch of the brain as beauty in art and music (field A1 of the medial orbitofrontal cortex); 15 mathematicians rated Euler's identity the most beautiful of 60 formulae (src:zeki-2014).
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.
a mathematical proof as mathematicians and logicians describe it: a statement shown to follow from axioms, definitions and earlier theorems by accepted steps, written or spoken, read and checked by people or machines, accepted by the community and built on (reader's view)
- L1: The argument as marks and sounds: proofs on paper, blackboard and screen in rigorous informal logic (symbols mixed with natural language), spoken in talks and conversation, and formal proof scripts in files.
- L2: Taking it in: reading symbols and figures, hearing a talk, a proof assistant parsing a script; readers 'translate back' from symbols to ideas.
- L3: The statement: definitions, axioms, the formal language, and the claim to be shown (a conjecture until proved).
- L4: Steps of inference: direct combination of earlier results, induction, contraposition, contradiction, construction, exhaustion, probabilistic and combinatorial arguments; in formal systems, each formula follows from those before by a rule.
- L5: Checking against a standard of rigour: readers, referees and colleagues looking for gaps; derivation systems that can be checked mechanically; proof-checker kernels; independent programs and verifiers.
- L6: Acceptance and understanding: the community convinced by communal standards, understanding gained, beauty felt; and the limits on what can be proved (undecidable statements, incompleteness).
- L7: Use: theorems cited without proof and built on, libraries of formal mathematics, teaching, verified hardware and software, and the advance of human understanding.
the boardroom (shared floors)
- L3: The statement: definitions, axioms and the claim, in a formal language or rigorous natural language; conjectures waiting for proof.
- L4: Steps of inference: methods of proof, intermediate results held in the head, cited theorems, computations and machine proposals, joined into a deductive pathway; in the brain, a fronto-parietal network with stronger delta synchrony in experts.
- L5: Checking: the standard of rigour applied by readers, referees and colleagues, and by mechanical checkers whose kernels admit only primitive steps; soundness of the derivation system.
- L6: Acceptance and understanding: the community convinced, understanding and beauty, the theorem taken into the shared body of knowledge; and the limits of provability (undecidable statements, incompleteness).
- L7: Use: theorems cited and built on, formal libraries, teaching, verified systems; for Thurston, the point is advancing human understanding.
way in: Automated provers and AI: proposed steps and whole proofs
- L1: Proposals from programs: the Logic Theorist (1956), sledgehammers, language models and agents writing Lean.
- L2: Search: automated procedures find proofs of 40-47% of library theorems; a language model drafts an outline for a sledgehammer to fill.
- L3: The proposal stated as a formal goal for the checker.
way in: Balance and posture (vestibular, proprioception) while following a proof
- L1: Gravity on the body, sitting or standing during a long demonstration.
- L2: Keeping balance when standing: a load that may compete with the concentration a complex proof needs, more for novices than experts.
way in: Computation: computer calculations as parts of a proof
- L1: Programs run on physical hardware (all devices can fail): case checks, linear programs, interval arithmetic.
- L2: Results: thousands of cases or inequalities settled (four colour: 1,936 cases; Kepler: nearly a thousand nonlinear inequalities, about 5000 CPU hours for one subclaim), or a certificate a checker can read.
- L3: The calculation stated precisely as a mathematical claim that the proof uses.
way in: Emotion (inner): beauty, joy, the wish to understand
- L1: Where the feeling comes from: contested (C-413); here met as the response to a formula or proof.
- L2: The felt response: a formula or proof judged beautiful, indifferent or ugly; joy in ways of thinking that explain and simplify.
- L3: Field A1 of the medial orbitofrontal cortex: activity rises with rated beauty, as for visual, musical and moral beauty.
way in: Hearing: talks, lectures, conversation, spoken statements
- L1: Speech: one-on-one conversation, seminar talks, colloquia; spoken statements judged true, false or meaningless in the scanner.
- L2: Listening: within a subfield a proof is passed in minutes and 'generally understood' in an hour's talk; outside it the audience is often lost.
way in: Machine input: a proof checker reads a formal proof script
- L1: The proof script: definitions and proofs in a formal language (HOL Light OCaml scripts, Coq, Lean files).
- L2: Parsing and elaboration: the script is turned into terms of the logic.
- L3: The formal statement: the claim fixed as a defined constant so its meaning is pinned down before checking.
- L4: The kernel: every theorem built only through a small secured kernel of primitive rules (about 400 lines in HOL Light).
way in: Sight and spatial sense: figures and diagrams
- L1: Figures and diagrams drawn in papers or at the board (Euclid's figures; the fragment P. Oxy. 29 shows one).
- L2: Vision and spatial sense take the figure in; there is no good 'inverse vision', so papers carry fewer and poorer figures than heads.
way in: Sight: written proofs, symbols and formulae
- L1: Marks: statements and proofs in symbols and natural language; formulae on a screen.
- L2: Reading: the expert reads 'between the lines', recognising idioms for concepts; formulae seen and rated (Zeki's 60 equations).
way in: The community: colleagues, referees, reviewers and chat
- L1: Messages from others: referee reports, letters, seminar questions, GitHub pull-request reviews and Zulip chat (mathlib).
- L2: Expert scrutiny: people find weaknesses better than they check formal correctness; referees may stop short (the Kepler referees at '99% certain').
- L3: Gaps filled on request: authors supply detail and corrections when called on.
- L4: A verdict: enough peers convinced, or an objection raised.
way in: The literature: theorems already accepted, cited without proof
- L1: Published papers and books, preprints, formal libraries (mathlib's 210,000 theorems, May 2025).
- L2: Citation: what others quote without proof and cite in their bibliography is taken up the same way; much is known with no written source.
- L3: The cited theorem enters as a statement to build on (a lemma, a library declaration).
way in: Thought (inner): logic, intuition, association, process
- L1: Where a proof idea comes from: contested (C-413); Thurston describes intuition as sensing without knowing the source.
- L2: Intuition, association and metaphor; 'listening' to intuitions takes a quieting and focusing of the mind.
- L3: Held logic: built-in reasoning (implication, contradiction); the proof's structure held in the head as a process of steps.
way in: Touch and kinesthetic sense: hands, gesture, Braille
- L1: Contact and motion: gestures, Braille under the fingers, things held in the hands.
- L2: Kinesthetic (motion) sense and the hands: thinking with objects held, scanned or moved through; access to the abstract content is the same whatever the input sense.
way out: Applying: verified software and hardware, cryptographic proofs
- L1: Running systems (a verified C compiler, an operating-system kernel) and protocols (zero-knowledge proofs).
- L7: Formal verification of designs: the same tools check hardware and software against specifications.
way out: Formalising: typing the proof into a proof assistant
- L1: Scripts and library entries (mathlib pull requests reviewed by maintainers).
- L5: The argument restated so a kernel can check every step; errors surface and are repaired.
way out: Speaking: talks, lectures, conversation, teaching
- L1: Speech with gestures, pictures and sound effects.
- L6: What the audience needs, two minutes for one subfield, an hour for another.
way out: Writing the proof: papers, preprints, notes, Q.E.D.
- L1: The paper, preprint or notes sent out (Thurston's notes to about 1200 people).
- L4: Steps written out in symbols and logic; the end marked.
- L6: The understood argument chosen for an audience.
Sources (32) published science
Four color theorem (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Avigad, Mathematics and the formal turn (arXiv 2311.00007v2, 2023) (behind its links)
Thurston, On proof and progress in mathematics, Bull. Amer. Math. Soc. 30(2) (1994) 161-177 (arXiv math/9404236) (behind its links)
Hilbert's program (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Hales, T. et al. (2017) A formal proof of the Kepler conjecture. Forum of Mathematics, Pi. arXiv:1501.02155 (behind its links)
Hales, T. C. (2014) Developments in formal proofs. Séminaire Bourbaki no. 1086. arXiv:1408.6474 (behind its links)
The mathlib Community (2020) The Lean mathematical library. CPP 2020, doi:10.1145/3372885.3373824. arXiv:1910.09336 (behind its links)
Mathematics (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Kepler conjecture (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Automated theorem proving (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Benzmüller, C. (2019) What is a proof? What should it be? arXiv:1904.06332 (behind its links)
Davenport, J., Poonen, B., Maynard, J., Helfgott, H., Tiep, P. H., Cruz-Filipe, L. (2018) Machine-assisted proofs (ICM 2018 panel report). arXiv:1809.08062 (behind its links)
Proof assistant (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Curry–Howard correspondence (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Dutilh Novaes, C. (2021, rev.) Argument and Argumentation. Stanford Encyclopedia of Philosophy (peer-reviewed reference work) (behind its links)
Logic (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Proof theory (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Euclid's theorem (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Gödel's incompleteness theorems (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Probabilistically checkable proof (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)