Difference between revisions of "Mathematical logic"
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) (→External links) |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 50: | Line 50: | ||
* [[Formal language]] | * [[Formal language]] | ||
* [[Formal grammar]] | * [[Formal grammar]] | ||
| + | * [[Formula (mathematics)]] | ||
* [[Foundations of mathematics]] | * [[Foundations of mathematics]] | ||
* [[Free and bound variables]] | * [[Free and bound variables]] | ||
| Line 58: | Line 59: | ||
* [[Mathematics]] | * [[Mathematics]] | ||
* [[Metamathematics]] | * [[Metamathematics]] | ||
| + | * [[Operand]] | ||
| + | * [[Operation (mathematics)]] | ||
* [[Recursion]] | * [[Recursion]] | ||
* [[Recursive definition]] | * [[Recursive definition]] | ||
| Line 70: | Line 73: | ||
* [https://en.wikipedia.org/wiki/Mathematical_logic Mathematical logic] @ Wikipedia | * [https://en.wikipedia.org/wiki/Mathematical_logic Mathematical logic] @ Wikipedia | ||
| + | |||
| + | [[Category:Logic]] | ||
| + | [[Category:Mathematical logic]] | ||
| + | [[Category:Mathematics]] | ||
Latest revision as of 15:51, 16 May 2016
Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics.
Contents
Description
It bears close connections to metamathematics, the foundations of mathematics, and theoretical computer science.
The unifying themes in mathematical logic include the study of the expressive power of formal systems and the deductive power of formal proof systems.
Fields
Mathematical logic is often divided into several fields, including:
These areas share basic results on logic, particularly first-order logic, and definability.
In computer science
In computer science (particularly in the ACM Classification), mathematical logic encompasses additional topics not detailed in this article -- see Logic in computer science.
History of mathematical logic
Since its inception, mathematical logic has both contributed to, and has been motivated by, the study of foundations of mathematics.
In the middle of the nineteenth century, George Boole and then Augustus De Morgan presented systematic mathematical treatments of algebraic logic.
Their work, building on work by algebraists such as George Peacock, extended the traditional Aristotelian doctrine of logic into a sufficient framework for the study of foundations of mathematics: axiomatic frameworks for geometry, arithmetic, and analysis.
In the early 20th century it was shaped by David Hilbert's program to prove the consistency of foundational theories.
Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in proving consistency.
Work in set theory showed that almost all ordinary mathematics can be formalized in terms of sets, although there are some theorems that cannot be proven in common axiom systems for set theory.
Contemporary work in the foundations of mathematics often focuses on establishing which parts of mathematics can be formalized in particular formal systems (as in reverse mathematics) rather than trying to find theories in which all of mathematics can be developed.
See also
- Algebraic logic
- Algorithm
- Axiom
- Boolean algebra
- Boolean function
- Charles Sanders Peirce
- Computer science
- Expression (mathematics)
- Formal language
- Formal grammar
- Formula (mathematics)
- Foundations of mathematics
- Free and bound variables
- Gödel numbering
- Logic
- Logic in computer science
- Logical consequence
- Mathematics
- Metamathematics
- Operand
- Operation (mathematics)
- Recursion
- Recursive definition
- Set theory
- Structure (mathematical logic)
- Syntax (logic)
- Theoretical computer science
- Turing completeness
- Variable (mathematics)
External links
- Mathematical logic @ Wikipedia
