Gödel's Incompleteness Completed: The Exterior That Every Formal System Requires

Read full text Summarise with VIRAT
Authors: Anees Hashmi
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Gödel proved in 1931 that every consistent formal system contains a true sentence it cannot prove. He did not ask what proves it. This paper formally answers that question. We define the Gödelian exterior of any formal system F as the class of consistent extensions that prove F's Gödel sentence. Six theorems characterize what every such extension must be: nonempty, not interpretable in F, of strictly greater proof-theoretic strength, closed under extension, with no maximal element, containing minimal elements that are consistent and not definable in F with their own consistency proof. The transfinite hierarchy F < F^1 < F^2 < ... < F^alpha < ... is proved strictly increasing and non-terminating through all countable ordinals. Applications are given to mathematical foundations, physical theories satisfying a formal axiomatization condition, and computational systems. Three open problems are stated. Problem 1 is answered: no formal system is closed under its own Gödelian exterior. Problems 2 and 3 concern the transfinite structure at uncountable ordinals and the proof-theoretic limit of the complete exterior.

Fields of Study & Subjects

Advanced Topology and Set Theory Computability Logic AI Algorithms programming and type systems

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
22 March 2026
Language
EN
Document type
Preprint