Related papers: On the information-theoretic approach to G\"odel's…
Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…
Information theory is gaining popularity as a tool to characterize performance of biological systems. However, information is commonly quantified without reference to whether or how a system could extract and use it; as a result,…
"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…
We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish…
In our previous arXiv papers (more systematically the informational conception is presented in the paper "The Information as Absolute", 2010) it was rigorously shown that Matter in our Universe - and Universe as a whole - are some…
These notes were written for a presentation given at the university Paris VII in January 2012. The goal was to explain a proof of a famous theorem by P. Deligne about coherent topoi (coherent topoi have enough points) and to show how this…
We develop first-order logic and some extensions for incomplete information scenarios and consider related complexity issues.
We address the problem of information completeness of quantum measuremets in connection to quantum state tomography and with particular concern to quantum symplectic tomography. We put forward some non-trivial situations where…
We define instantiational and algorithmic completeness for a formal language. We show that, in the presence of Church's Thesis, an alternative interpretation of Goedelian incompleteness is that Peano Arithmetic is instantiationally…
Deficiencies in Kauffman's proposal regarding a new way for building scientific theories are pointed out. A suggestion to overcome them, and in fact, independently construct mathematical theories which are beyond the reach of Goedel's…
This paper is a continuation of Arai's paper on derivability conditions for Rosser provability predicates. We investigate the limitations of the second incompleteness theorem by constructing three different Rosser provability predicates…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
In this paper, we first present simple proofs of Choi's results [4], then we give a short alternative proof for Fiedler and Markham's inequality [6]. We also obtain additional matrix inequalities related to partial determinants.
In an earlier paper, "Omega-inconsistency in Goedel's formal system: a constructive proof of the Entscheidungsproblem" (math/0206302), I argued that a constructive interpretation of Goedel's reasoning establishes any formal system of…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
We prove a modified scattering and asymptotic completeness for the derivative nonlinear Schr\"odinger equation. This is the first result proving asymptotic completeness in a quasilinear setting. Our approach combines the method of testing…
The following three sections and appendices are taken from my thesis "The Foundations of Inference and its Application to Fundamental Physics" from 2021, in which I construct a theory of entropic inference from first principles. The…
Rejoinder to "Quantifying the Fraction of Missing Information for Hypothesis Testing in Statistical and Genetic Studies" [arXiv:1102.2774]
We describe a plan how to prove an effective Siegel theorem (about the exceptional Dirichlet character). We give a brief outline in Section 0. We give a more detailed plan in Sections 1-5. The missing details (mostly routine elementary…