Related papers: Relative normalization
We give a survey of current research on G\"{o}del's incompleteness theorems from the following three aspects: classifications of different proofs of G\"{o}del's incompleteness theorems, the limit of the applicability of G\"{o}del's first…
We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…
We derive a consistency result, in the $L_1$-sense, for incomplete U-statistics in the non-standard case where the kernel at hand has infinite second-order moments. Assuming that the kernel has finite moments of order $p(\geq 1)$, we obtain…
This proof of Godel's first incompleteness theorem doesn't require omega-consistency, nor does it refer to codes of negated sentences as in Rosser's. It begins from where Godel's usual proof ends, and stalks it till it ends proving it.
The theory of regularity is a philosophical perspective in which laws of nature are just descriptions, that is to say, laws of nature do not govern the world. Moreover, according to the theory of regularity, the number of laws of nature…
Regularization is a core component of modern inverse problems, as it helps establish the well-posedness of the solution of interest. Popular regularization approaches include variational regularization and iterative regularization. The…
The generalized second law is proven for semiclassical quantum fields falling across a causal horizon, minimally coupled to general relativity. The proof is much more general than previous proofs in that it permits the quantum fields to be…
This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…
Both relativistic mechanics and Newtonian mechanics are based on principles that have ontological implications. We propose a series of formalisms that rigorously define the ontology underlying mechanical theories, in order to clarify and…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
We prove theorems of the following form: if $A\subseteq {\mathbb R}^2$ is a big set, then there exists a big set $P\subseteq {\mathbb R}$ and a perfect set $Q\subseteq {\mathbb R}$ such that $P\times Q\subseteq A$. We discuss cases where…
We study Tao's finitary viewpoint of convergence in metric spaces, as captured by the notion of metastability. We adopt the perspective of continuous model theory. We show that, in essence, metastable convergence with a given rate is the…
We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
In this paper, we examine the limit of applicability of G\"{o}del's first incompleteness theorem ($\sf G1$ for short). We first define the notion "$\sf G1$ holds for the theory $T$". This paper is motivated by the following question: can we…