相关论文: On the depth of G\"{o}del's incompleteness theorem

Classical interpretations of Goedel's formal reasoning imply that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is essentially unverifiable. However, a language of general,…

Some properties of the G\"odel space-time metric and its Riemann extension are studied

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

Inconsistency Robustness is performance of information systems with pervasively inconsistent information. Inconsistency Robustness of the community of professional mathematicians is their performance repeatedly repairing contradictions over…

We study the completeness of a metric which is related to the Bergman metric of a bounded domain. We provide a criterion for its completeness in the spirit of the Kobayashi criterion for the completeness of the Bergman metric. In particular…

We propose a definition of magnitude for a length space with a Borel measure, which involves integrals over the set of geodesics. This quantity agrees with the magnitude of finite metric spaces, up to re-scaling the metric to ensure the…

We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an ''intensional'' or ''effective'' view of respectively ill-and well-foundedness properties to an…

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…

Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions. Deep inference provides more…

We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…

We investigate completeness for modal G\"odel logics with respect to finite G\"odel-Kripke models, along with related aspects. It is well known that the logics studied in [4, 11] fail to be complete with respect to finite G\"odel-Kripke…

In this paper we consider an approach where both propositions and the accessibility relation are infinitely many-valued over G\"{o}del algebras. In particular, we consider separately the $\Box $-fragment and the $\Diamond $-fragment of our…

The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…

We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…

Given arbitrary homogeneous ideals $I$ and $J$ in polynomial rings $A$ and $B$ over a field $k$, we investigate the depth and the Castelnuovo-Mumford regularity of powers of the sum $I+J$ in $A \otimes_k B$ in terms of those of $I$ and $J$.…

The world of mathematics is often considered abstract, with its symbols, concepts, and topics appearing unrelated to physical objects. However, it is important to recognize that the development of mathematics is fundamentally influenced by…

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

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…