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 proof
(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!
==Undecidable statements== A statement that is neither provable nor disprovable from a set of [[axiom]]s is called undecidable (from those axioms). One example is the [[parallel postulate]], which is neither provable nor refutable from the remaining axioms of [[Euclidean geometry]]. Mathematicians have shown there are many statements that are neither provable nor disprovable in [[Zermelo–Fraenkel set theory with the axiom of choice]] (ZFC), the standard system of set theory in mathematics (assuming that ZFC is consistent); see [[List of statements undecidable in ZFC]]. [[Gödel's incompleteness theorem|Gödel's (first) incompleteness theorem]] shows that many axiom systems of mathematical interest will have undecidable statements.
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)