English
Related papers

Related papers: G\"odel's Theorem and Direct Self-Reference

200 papers

We introduce the G\"odel Mirror, a formal system defined in Lean 4 that treats contradiction as a control signal for recursive structural evolution. Inspired by G\"odelian self-reference, our system's operational semantics encode symbolic…

Logic in Computer Science · Computer Science 2025-09-23 Jhet Chan

The Goedelian approach is discussed as a prime example of a science towards the origins. While mere selfreferential objectification locks in to its own byproducts, self-releasing objectification informs the formation of objects at hand and…

History and Philosophy of Physics · Physics 2015-11-20 Vasileios Basios , Emilios Bouratinos

According to Russell, strict uses of the definite article 'the' in a definite description 'the F' involve uniqueness; in case there is more than one F, 'the F' is used somewhat loosely, and an indefinite description 'an F' should be…

Logic in Computer Science · Computer Science 2025-01-03 Bartosz Więckowski

We construct a counterexample to a conjectured inequality L<2D, relating the diameter D and the least length L of a nontrivial closed geodesic, for a Riemannian metric on the 2-sphere. The construction relies on Guillemin's theorem…

Differential Geometry · Mathematics 2014-10-03 Florent Balacheff , Christopher Croke , Mikhail G. Katz

Different from the view that information is objective reality, this paper adopts the idea that all information needs to be compiled by the interpreter before it can be observed. From the traditional complexity definition, this paper defines…

Logic in Computer Science · Computer Science 2025-02-18 Zhifeng Ma , Tianyi Wu , Zhangang Han

The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…

Combinatorics · Mathematics 2021-04-13 Brian Rabern , Landon Rabern

Circular and non-wellfounded proofs have become an increasingly popular tool for metalogical treatments of systems with forms of induction and/or recursion. In this work we investigate the expressivity of a variant CT of G\"odel's system T…

Logic in Computer Science · Computer Science 2021-01-19 Anupam Das

For which choices of $X,Y,Z\in\{\Sigma^1_1,\Pi^1_1\}$ does no sufficiently strong $X$-sound and $Y$-definable extension theory prove its own $Z$-soundness? We give a complete answer, thereby delimiting the generalizations of G\"odel's…

Logic · Mathematics 2026-01-28 Henry Towsner , James Walsh

In this paper we present a new proof of Solovay's theorem on arithmetical completeness of G\"odel-L\"ob provability logic GL. Originally, completeness of GL with respect to interpretation of $\Box$ as provability in PA was proved by R.…

Logic · Mathematics 2017-05-24 Fedor Pakhomov

Goedel's explicit thesis was that his undecidable formula GUS is a well-formed, well-defined formal sentence in any formalisation of Intuitive Arithmetic IA in which the axioms and rules of inference are recursively definable. His implicit…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

In order to state the theorem in the title formally and to review its rigorous proof, we extend and make more precise the Uspenskiy-Shen-Akopyan-Fedorov model of Euclidean constructions with arbitrary points; we also introduce…

Metric Geometry · Mathematics 2021-07-22 Martin Klazar

It is generally accepted that the incompleteness of first-order number theory (PA) is established by an application of Godel's proof. This paper shows that the arithmetization of the syntax of PA implies that the hypothesised class of PA…

General Mathematics · Mathematics 2026-05-26 Stephen Boyce

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing…

Logic · Mathematics 2020-08-27 Samuel Allen Alexander

G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…

Logic in Computer Science · Computer Science 2015-07-01 Matthias Baaz , Agata Ciabattoni , Christian G Fermüller

Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between…

History and Philosophy of Physics · Physics 2025-12-16 Evan Redden

Standard expositions of Goedel's 1931 paper on undecidable arithmetical propositions are based on two presumptions in Goedel's 1931 interpretation of his own, formal, reasoning - one each in Theorem VI and in Theorem XI - which do not meet…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

Analogous to G\"odel's incompleteness theorems is a theorem in physics to the effect that the set of explanations of given evidence is uncountably infinite. An implication of this theorem is that contact between theory and experiment…

History and Philosophy of Physics · Physics 2019-02-14 John M. Myers , F. Hadi Madjid

The 20th century has revealed two important limitations of scientific knowledge. On the one hand, the combination of Poincar\'e's nonlinear dynamics and Heisenberg's uncertainty principle leads to a world picture where physical reality is,…

History and Philosophy of Physics · Physics 2013-04-10 Fernando Sols

I investigate the question whether G\"odel's undecidability theorems play a crucial role in the search for a unified theory of physics. I conclude that unless the structure of space-time is fundamentally discrete we can never decide whether…

General Relativity and Quantum Cosmology · Physics 2024-02-27 Claus Kiefer

This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…

Computational Complexity · Computer Science 2010-09-02 Ketan Mulmuley
‹ Prev 1 3 4 5 6 7 10 Next ›