2002/04/16 by Bhupinder Singh Anand, Anand, Bhupinder Singh
Arts and Humanities · Computer Science · Mathematics · #03B10 #Epistemology, Ethics, and Metaphysics #FOS: Mathematics #General Mathematics (math.GM) #Information and Cyber Security #Multi-Agent Systems and Negotiation #math.GM #msc:03B10
paper · pdf · doi:10.48550/arxiv.math/0204199
v3: Introduced ACI compliant notation for citations. 30 pages. An HTML version is available on the web at http://alixcomsi.com/index01.htm
openalex publication_date 2002/04/16 · arxiv created 2003/05/11 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.