- #36
Hurkyl
Staff Emeritus
Science Advisor
Gold Member
- 14,983
- 28
Of course; the proof of this is trivial: given any undecidable statement P in a theory claimed to be absolutely undecidable, simply construct a new theory by adding P as an axiom. Contradiction!lugita15 said:No, contrary to popular belief Godel's theorem does NOT say there is a single statement that is undecidable in all sufficiently strong axiomatic systems.
And, in particular, Godel's theorem applies to any (computable) scheme for constructing a sequence of progressively more inclusive axiomatic systems.Rather, it says that for each sufficiently strong axiomatic system, there exists a statement in that system, but easily decidable in other systems.
But don't forget we're talking about the informal notion of "known"; even if we assume there is a notion of objective truth, given our knowledge of incompleteness theorems, what sort of scheme could possibly produce any objective through and still be plausibly called "known"?
(the only loopholes I can imagine require some sort of temporal logic; e.g. depend on us having a non-deterministic oracle we have absolute faith into give us new "known" statements, which have a chance of producing any truth sometime in the future. But then, is that really plausible?)