Reviewing Goedel's and Rosser's meta-reasoning of undecidability

Details Reviewing Goedel's and Rosser's meta-reasoning of undecidability Reviewing Goedel's and Rosser's meta-reasoning of undecidability

2002-04-16

arxiv.org/abs/math/0204199v3

Mathematics

General Mathematics

v3: Introduced ACI compliant notation for citations. 30 pages. An HTML version is available on the web at http://alixcomsi.com

Scientific paper

I review the classical conclusions drawn from Goedel's meta-reasoning establishing an undecidable proposition GUS in standard PA. I argue that, for any given set of numerical values of its free variables, every recursive arithmetical relation can be expressed in PA by different, but formally equivalent, propositions. This asymmetry yields alternative Representation and Self-reference meta-Lemmas. I argue that Goedel's meta-reasoning can thus be expressed avoiding any appeal to the truth of propositions in the standard interpretation IA of PA. This now establishes GUS as decidable, and PA as omega-inconsistent. I argue further that Rosser's extension of Goedel's meta-reasoning involves an invalid deduction.

Affiliated with

Also associated with

No associations

Rating

Reviewing Goedel's and Rosser's meta-reasoning of undecidability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reviewing Goedel's and Rosser's meta-reasoning of undecidability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reviewing Goedel's and Rosser's meta-reasoning of undecidability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11316