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
Hilbert's second problem
(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!
{{Short description|Consistency of the axioms of arithmetic}} In [[mathematics]], '''Hilbert's second problem''' was posed by [[David Hilbert]] in 1900 as one of his [[Hilbert's problems|23 problems]]. It asks for a proof that arithmetic is [[consistency proof|consistent]] – free of any internal contradictions. Hilbert stated that the axioms he considered for arithmetic were the ones given in {{harvtxt|Hilbert|1900}}, which include a second order completeness axiom. In the 1930s, [[Kurt Gödel]] and [[Gerhard Gentzen]] proved results that cast new light on the problem. Some feel that Gödel's theorems give a negative solution to the problem, while others consider Gentzen's proof as a partial positive solution.
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)