Re:A New Provable Factoring Algorithm
by thaumasiotes on Thursday October 23, 2014 @10:08PM
(#8501800)
That all depends whether you're comfortable saying a contradiction is "consistent" with an unrelated proposition; I don't see much of a problem with it. Contradictions, being impossible, are logically consistent with everything else. I guess unprovable propositions would switch over to being provable, though.
> That all depends whether you're comfortable saying a contradiction is "consistent" with an unrelated proposition; I don't see much of a problem with it. Contradictions, being impossible, are logically consistent with everything else. I guess unprovable propositions would switch over to being provable, though.
Oh, I see. I read "A is consistent with B" as "A+B is consistent", but I can see the validity of the reading "A+B is 'as consistent as' A".
In fact, singling out ZFC gives you another example of this kind of result: if ZF is consistent, then so are ZF+C and ZF-C.