Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Mathematical logic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Foundations of mathematics == {{Main|Foundations of mathematics}} In the 19th century, mathematicians became aware of logical gaps and inconsistencies in their field. It was shown that [[Euclid]]'s axioms for geometry, which had been taught for centuries as an example of the axiomatic method, were incomplete. The use of [[infinitesimal]]s, and the very definition of [[Function (mathematics)|function]], came into question in analysis, as pathological examples such as Weierstrass' nowhere-[[Differentiable function|differentiable]] continuous function were discovered. Cantor's study of arbitrary infinite sets also drew criticism. [[Leopold Kronecker]] famously stated "God made the integers; all else is the work of man," endorsing a return to the study of finite, concrete objects in mathematics. Although Kronecker's argument was carried forward by constructivists in the 20th century, the mathematical community as a whole rejected them. [[David Hilbert]] argued in favor of the study of the infinite, saying "No one shall expel us from the Paradise that Cantor has created." Mathematicians began to search for axiom systems that could be used to formalize large parts of mathematics. In addition to removing ambiguity from previously naive terms such as function, it was hoped that this axiomatization would allow for consistency proofs. In the 19th century, the main method of proving the consistency of a set of axioms was to provide a model for it. Thus, for example, [[non-Euclidean geometry]] can be proved consistent by defining ''point'' to mean a point on a fixed sphere and ''line'' to mean a [[great circle]] on the sphere. The resulting structure, a model of [[elliptic geometry]], satisfies the axioms of plane geometry except the parallel postulate. With the development of formal logic, Hilbert asked whether it would be possible to prove that an axiom system is consistent by analyzing the structure of possible proofs in the system, and showing through this analysis that it is impossible to prove a contradiction. This idea led to the study of [[proof theory]]. Moreover, Hilbert proposed that the analysis should be entirely concrete, using the term ''finitary'' to refer to the methods he would allow but not precisely defining them. This project, known as [[Hilbert's program]], was seriously affected by Gödel's incompleteness theorems, which show that the consistency of formal theories of arithmetic cannot be established using methods formalizable in those theories. Gentzen showed that it is possible to produce a proof of the consistency of arithmetic in a finitary system augmented with axioms of [[transfinite induction]], and the techniques he developed to do so were seminal in proof theory. A second thread in the history of foundations of mathematics involves [[nonclassical logic]]s and [[constructive mathematics]]. The study of constructive mathematics includes many different programs with various definitions of ''constructive''. At the most accommodating end, proofs in ZF set theory that do not use the axiom of choice are called constructive by many mathematicians. More limited versions of constructivism limit themselves to [[natural numbers]], [[number-theoretic function]]s, and sets of natural numbers (which can be used to represent real numbers, facilitating the study of [[mathematical analysis]]). A common idea is that a concrete means of computing the values of the function must be known before the function itself can be said to exist. <!-- ref "Varieties of constructive mathematics" --> In the early 20th century, [[Luitzen Egbertus Jan Brouwer]] founded [[intuitionism]] as a part of [[philosophy of mathematics]]. This philosophy, poorly understood at first, stated that in order for a mathematical statement to be true to a mathematician, that person must be able to ''intuit'' the statement, to not only believe its truth but understand the reason for its truth. A consequence of this definition of truth was the rejection of the [[law of the excluded middle]], for there are statements that, according to Brouwer, could not be claimed to be true while their negations also could not be claimed true. Brouwer's philosophy was influential, and the cause of bitter disputes among prominent mathematicians. Kleene and Kreisel would later study formalized versions of intuitionistic logic (Brouwer rejected formalization, and presented his work in unformalized natural language). With the advent of the [[BHK interpretation]] and [[Kripke model]]s, intuitionism became easier to reconcile with classical mathematics.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)