Mathematical software and formalization
Summary
Mathematical software and formalization is the study of mathematics done with computers. A proof assistant is a program that checks each step of a formal proof against the rules of a logic. Computers now check long proofs, search large sets of finite cases, compute with symbols, and store large collections of mathematical data. Automated theorem proving began in the 1950s, de Bruijn's Automath system of the late 1960s started the machine checking of formal proofs, and Appel and Haken proved the four colour theorem with a computer in 1976. This topic collects the math2 pages on proof assistants and formal libraries, landmark formalizations, automated theorem proving, SAT and SMT solving, computer-assisted proof, computer algebra, experimental mathematics, mathematical databases, knowledge management, typesetting, and artificial intelligence in mathematics. Type theory and constructive mathematics, mathematical logic, theory of computation, and the mathematics of machine learning have their own topics.
Remarks
Sub-areas
- Overview and history
- Proof assistants and their design
- Formal libraries and library design
- Landmark formalizations
- Automated theorem proving
- SAT and SMT solving
- Computer-assisted proof and verification
- Foundations of computer algebra
- Polynomial gcd and factorization
- Symbolic integration and summation
- Tools of experimental mathematics
- Mathematical databases
- Mathematical knowledge management
- Mathematical typesetting
- Artificial intelligence and mathematics
Everything in this topic
The members of this topic and each page that they need, 15 pages in all.
Show the path as a graph
- no evidence level
- Artificial intelligence and mathematics topic member
- Automated theorem proving topic member
- Computer-assisted proof and verification topic member
- Formal libraries and library design topic member
- Foundations of computer algebra topic member
- Landmark formalizations topic member
- Mathematical databases topic member
- Mathematical knowledge management topic member
- Mathematical typesetting topic member
- Overview and history topic member
- Polynomial gcd and factorization topic member
- Proof assistants and their design topic member
- SAT and SMT solving topic member
- Symbolic integration and summation topic member
- Tools of experimental mathematics topic member
About this page
| Tag | F3F5GGYHMM |
|---|---|
| URI | m2://F3F5GGYHMM |
| Kind | topic |
| Writing | W0 stub |
| MSC | 68Vxx, 68W30, 03B35 |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
Nodes in this topic
- SAT and SMT solving
- Computer-assisted proof and verification
- Polynomial gcd and factorization
- Mathematical databases
- Automated theorem proving
- Symbolic integration and summation
- Overview and history
- Artificial intelligence and mathematics
- Tools of experimental mathematics
- Formal libraries and library design
- Foundations of computer algebra
- Mathematical knowledge management
- Landmark formalizations
- Mathematical typesetting
- Proof assistants and their design