Gödel's Incompleteness Theorems Interpreted through the Superposition Principle

This paper interprets Gödel’s incompleteness theorems through the Superposition Principle developed by the author from the study of ancient philosophy. The central thesis is that incompleteness can be understood as a boundary event in which the truth–falsehood pair cannot be fully internalized by the proof rules of a formal system.

According to the Superposition Principle, opposition is not the relation between two independently given entities, but the manifestation of a single oppositional structure in opposite directions within a field of judgment. Applied to truth and falsehood, this means that T≠FT\neq FT=F is preserved at the level of truth values, while $T\sim F$ is interpreted structurally as the mutual determination of truth and falsehood within the pair PT=(T/F)P_T=(T/F)PT=(T/F).

The paper connects this framework with Gödel’s distinction between truth and provability and with Tarski’s undefinability of truth. Gödel’s sentence is interpreted as a boundary term in which truth and unprovability overlap. In this sense, incompleteness is not treated as a replacement for Gödel’s formal proof, but as a structural phenomenon: the binary opposition between provability and refutability cannot fully internalize the truth–falsehood boundary.

This work was written by using ChatGPT after the author instructed it with the principle of superposition of opposition and negation, a philosophical framework developed by the author through the study of ancient philosophy.

본 논문은 저자가 고대 철학 연구를 바탕으로 정립한 “대립과 부정의 중첩 원리”를 통해 괴델 불완전성 정리를 해석한다. 논문의 핵심은 형식 체계의 불완전성을 단순히 참과 증명 가능성의 불일치로 보는 데 그치지 않고, 참/거짓 대립쌍의 경계를 증명/반증의 이항 구조가 완전히 내부화하지 못하는 사건으로 이해하는 데 있다.

본 논문에서 $T\sim F$는 고전 논리의 $T=F$를 뜻하지 않는다. 참과 거짓은 판단값 층위에서는 T≠FT\neq FT=F로 구별되지만, 구조 층위에서는 하나의 참/거짓 대립쌍 PT=(T/F)P_T=(T/F)PT=(T/F) 안에서 서로를 통해 규정된다. 괴델 문장 $G$는 이 구조 안에서 참이지만 증명 불가능한 경계항으로 해석된다.

본 논문은 저자가 고대 철학을 연구하여 정립한 대립과 부정의 중첩 원리를 ChatGPT에게 학습시킨 뒤 ChatGPT를 이용하여 작성하였다.