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!
== Modern viewpoints on the status of the problem == While the theorems of Gödel and Gentzen are now well understood by the mathematical logic community, no consensus has formed on whether (or in what way) these theorems answer Hilbert's second problem. {{harvtxt|Simpson|1988}} argues that Gödel's incompleteness theorem shows that it is not possible to produce finitistic consistency proofs of strong theories.{{sfnp|Simpson|1988|loc= sec. 3}} {{harvtxt|Kreisel|1976}} states that although Gödel's results imply that no finitistic syntactic consistency proof can be obtained, semantic (in particular, [[Second-order logic|second-order]]) arguments can be used to give convincing consistency proofs. {{harvtxt|Detlefsen|1990}} argues that Gödel's theorem does not prevent a consistency proof because its hypotheses might not apply to all the systems in which a consistency proof could be carried out.{{sfnp|Detlefsen|1990|p=65}} {{harvtxt|Dawson|2006}} calls the belief that Gödel's theorem eliminates the possibility of a persuasive consistency proof "erroneous", citing the consistency proof given by Gentzen and [[Dialectica interpretation|a later one given by Gödel in 1958]].{{sfnp|Dawson|2006|loc= sec. 2}}
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)