A precise definition
Mathematical logic studies formal systems of inference: propositional logic, first-order predicate logic, modal logic. Computability theory asks which problems can, in principle, be solved by any algorithm. Complexity theory asks which solvable problems can be solved efficiently. Type theory connects logic to programming language design. Together, these form the theoretical foundations of all computing.
The problem it was invented to solve
Alan Turing's 1936 paper 'On Computable Numbers' — written at 23, before electronic computers existed — defined a mathematical model of computation (the Turing machine) and proved that some problems are undecidable — no algorithm can solve them. Gödel's incompleteness theorems (1931) had already shown that some mathematical truths cannot be proved. Shannon's 1948 information theory defined the bit and the channel capacity. These three results are the intellectual foundation of the information age.
Where you find it in the world — including South Africa
These are not contrived textbook examples. Each application below is currently in use, driven by real institutions, and producing real outcomes.
Formal verification: proving software correct
Safety-critical software — aircraft flight control, medical device firmware, nuclear plant control — is verified using formal methods (model checking, theorem provers) rooted in mathematical logic. SA aerospace companies and medical device manufacturers are increasingly required to use formal verification.
AI and automated reasoning
Large language models, knowledge graphs, and automated theorem provers all involve formal logic. The 'reasoning' capabilities of AI systems are bounded by computability theory — Gödel's limits apply to any formal AI system.
Database query optimisation
SQL query optimisers in Oracle, PostgreSQL, and MySQL use algorithms from computational complexity theory to find efficient query execution plans. SA banks and government systems running billions of queries per day depend on this.
You've already encountered this
Every time you Google something, an algorithm decides which page to show you. The NP-complete problem of finding the optimal ranking is approximated using heuristics — because if P ≠ NP, there is no efficient exact algorithm. The Millennium Prize Problem you've never heard of is quietly running the internet.
Where it connects in the map of mathematics
Related topics and institutions
The theory of computation begins where school mathematics ends.
The Continuum builds the logical reasoning skills — proof, abstraction, formal argument — that are the prerequisites for theoretical computer science, not as separate skills, but woven into the mathematics curriculum.
No card required. South African curriculum. Grade 8–12.