Undecidable statement made into axiom?

  • Thread starter gravenewworld
  • Start date
  • Tags
    Axiom
In summary: Aleph_0<x<c?No. The fact that the CH is independent of ZFC already implies that its negation is independent of ZFC. Adding the negation of the CH would not prove anything new.
  • #1
gravenewworld
1,132
26
i am a little bit confused on 1 thing. can a statement that is undecidable in a axiomatic system just be added as a axiom to the original system and never lead to a contridiction?

for example godel and cohen showed that the continuum hypothesis is independent of ZFC. does this mean then that if we add the CH or its negation as an axiom to ZFC we will still have a system that is still consistent (assuming ZFC is already consistent)? Does this mean then that if I add the negation of the CH i can show that there is some cardinal x such that aleph_0<x<c?

this is the wiki article that is confusing me-
http://en.wikipedia.org/wiki/Axiom_of_choice#Independence_of_AC

quote from article: "By work of Kurt Gödel and Paul Cohen, the axiom of choice is logically independent of the other axioms of Zermelo-Fraenkel set theory (ZF). This means that neither it nor its negation can be proven to be true in ZF. Consequently, assuming the axiom of choice, or its negation, will never lead to a contradiction that could not be obtained without that assumption."

so if the CH( or ~CH) can be added to ZFC(since it was proven independent just like AC), then why is it still unsolved?
 
Last edited:
Physics news on Phys.org
  • #2
i am a little bit confused on 1 thing. can a statement that is undecidable in a axiomatic system just be added as a axiom to the original system and never lead to a contridiction?
You are correct.

If [itex]\Phi[/itex] is some collection of statements, and [itex]\phi[/itex] is a statement that is "undecidable" in [itex]\mathcal{TH}(\Phi)[/itex]... that is, neither [itex]\phi[/itex] nor [itex]\neg \phi[/itex] follow from [itex]\Phi[/itex]... then [itex]\Phi \cup \{ \phi \}[/itex] is a consistent collection of statements. (And so is [itex]\Phi \cup \{ \neg \phi \}[/itex])


(P.S. anybody know how I can get a nice, fancy lower-case script letter? If I try to turn [itex]Th[/itex] into the mathcal font, I get [itex]\mathcal{Th}[/itex])
 
Last edited:
  • #3
i think it is decidable, in fact i have decided the answer is no.
 
  • #4
Hurkyl said:
You are correct.

If [itex]\Phi[/itex] is some collection of statements, and [itex]\phi[/itex] is a statement that is "undecidable" in [itex]\mathcal{TH}(\Phi)[/itex]... that is, neither [itex]\phi[/itex] nor [itex]\neg \phi[/itex] follow from [itex]\Phi[/itex]... then [itex]\Phi \cup \{ \phi \}[/itex] is a consistent collection of statements. (And so is [itex]\Phi \cup \{ \neg \phi \}[/itex])(P.S. anybody know how I can get a nice, fancy lower-case script letter? If I try to turn [itex]Th[/itex] into the mathcal font, I get [itex]\mathcal{Th}[/itex])
Ok, I still don't understand why then people are still trying to prove the falsity of the continuum hypothesis. If the continuum hypothesis is independent of ZFC, then it can be added as an axiom. But if it is an axiom shouldn't it be universally true, why would people still bother trying to negate it?
 
  • #5
If the negation of the continuum hypothesis is independent of ZF, then it could be added as an axiom.

One might not want to assume the CH. Just as people might not want to assume the AC.

And then, one might want to classify other statements in terms of how they relate to the CH. In other words, one might find it useful to know that P=>~CH. Among other things that would prove that P is independent of ZF.

(You sure the CH is independent of ZFC? I know it is independent of ZF, but I can't remember ZFC for sure)
 
  • #6
Hurkyl said:
If the negation of the continuum hypothesis is independent of ZF, then it could be added as an axiom.

One might not want to assume the CH. Just as people might not want to assume the AC.

And then, one might want to classify other statements in terms of how they relate to the CH. In other words, one might find it useful to know that P=>~CH. Among other things that would prove that P is independent of ZF.

(You sure the CH is independent of ZFC? I know it is independent of ZF, but I can't remember ZFC for sure)


But doesn't the fact that the CH is independent of ZFC already imply that its negation is independent of ZFC (or is the article i am reading simply wrong)? I also am pretty sure that CH has already been proven independent of ZFC.
 
  • #7
gravenewworld said:
But doesn't the fact that the CH is independent of ZFC already imply that its negation is independent of ZFC
Yes. Incidentally, that wiki article is talking about the GCH, not the CH.
 
  • #8
Hurkyl said:
Yes. Incidentally, that wiki article is talking about the GCH, not the CH.


I actually was reading that article and from what it said about the AC, I just made an analogy to the CH (cohen and godel showed that CH is independent of ZFC). So if we add ~CH to ZFC, it will be consistent. Doesn't this mean now that we can find a cardinal call it x such that aleph0<x<c?
 
  • #9
Yes. ZFC~CH implies the existence of such a cardinal.
 
  • #10
alright thanks a bunch. i think i am out of questions now.
 

FAQ: Undecidable statement made into axiom?

What is an undecidable statement?

An undecidable statement is a mathematical statement that cannot be proven or disproven within a given mathematical system. This means that there is no definitive answer to the statement, and it is impossible to determine whether it is true or false.

How is an undecidable statement made into an axiom?

In mathematics, axioms are statements that are accepted as true without proof. When a statement is proven to be undecidable within a given system, it can be adopted as an axiom, meaning that it is accepted as true without further proof.

Why are undecidable statements important?

Undecidable statements are important because they demonstrate the limitations of a given mathematical system. They also challenge mathematicians to find ways to extend or modify the system in order to prove or disprove the statement. Additionally, they have implications for the foundations of mathematics and the concept of truth.

Can an undecidable statement ever be proven?

No, an undecidable statement cannot be proven within the system in which it is undecidable. However, it is possible for a statement to be proven undecidable in one system and then proven true or false in a different system.

How do undecidable statements relate to Gödel's incompleteness theorems?

Undecidable statements are a result of Gödel's incompleteness theorems, which demonstrate that there are statements within a formal mathematical system that cannot be proven or disproven within that system. This highlights the inherent limitations of any formal system and the unattainability of a complete and consistent set of axioms.

Similar threads

Replies
10
Views
2K
Replies
1
Views
2K
Replies
31
Views
5K
Replies
5
Views
873
Replies
7
Views
3K
Replies
7
Views
3K
Back
Top