Related papers: On the information-theoretic approach to G\"odel's…
Boolos's proof of incompleteness is extended straightforwardly to yield simple ``diagonalization-free'' proofs of some classical limitative theorems of logic.
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…
Matrix completion is a fundamental problem that comes up in a variety of applications like the Netflix problem, collaborative filtering, computer vision, and crowdsourcing. The goal of the problem is to recover a k-by-n unknown matrix from…
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…
This paper is purely expository. We present short elementary proofs of * the Gauss Theorem on constructibility of regular polygons; * the existence of a cubic equation unsolvable in real radicals; * the existence of a quintic equation…
In this article, we review the information loss paradox in the spirit of the Euclidean path integral approach. First, we argue that there is a long debate about the information loss paradox, and the non-perturbative quantum gravitational…
The article has as its main objective the identification of fundamental epistemological obstacles in the study of information related to unnecessary methodological assumptions and the demystification of popular beliefs in the fundamental…
These five lectures on undecidability were given to students with a good level in mathematics but with no special knowledge on logic. The first conference presents the formalization of mathematics with a short historical survey, the…
What would be the consequences if there were fundamental limits to our ability to experimentally explore the world? In this work we seriously consider this question. We assume the existence of statements whose truth value is not…
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…
An Isabelle/HOL formalisation of G\"odel's two incompleteness theorems is presented. The work follows \'Swierczkowski's detailed proof of the theorems using hereditarily finite (HF) set theory. Avoiding the usual arithmetical encodings of…
The latest in a series of reports presenting the information-theoretic incompleteness theorems of algorithmic information theory via algorithms written in specially designed versions of LISP. Previously in this LISP code only one-character…
Following G. Mints(Kluwer 2000 and draft 2013), we present terminating and bicomplete proof searches in multi-succedent sequent calculi for intuitionistic propositional logic, fragments of intuitionistic predicate logic and full…
We introduce some early considerations of physical and mathematical impossibility as preludes to the Goedel incompleteness theorems. We consider some informal aspects of these theorems and their underlying assumptions and discuss some the…
G\"odel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*. We settle the complexity of satisfiability of GCTL*,…
G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…
In this work, we derive information-theoretic properties for a modified Tsallis entropy, hereinafter referred to as q-entropy. We introduce the notions of joint q-entropy, conditional q-entropy, relative q-entropy, conditional mutual…
This paper revisits the foundations of mathematical proof through the lens of Aristotle's threefold conception of truth: sensory evidence, axiomatic definition, and syllogistic deduction. I argue that modern mathematics has too often…