Related papers: G\"{o}del's incompleteness theorem and the Anti-Me…
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…
Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…
This book concerns the metasemantics of quantum mechanics (QM). Roughly, it pursues an investigation at the intersection of philosophy of physics and philosophy of language, and it offers a critical analysis of rival explanations of the…
In this note we provide a (decidable) graph-structural characterisation of the infiniteness of $L(w_1, ..., w_k)$, where $L(w_1, ..., w_k) = \{w \in A^* | |w|_{w_1} = \cdots = |w|_{w_k}\}$ is the set of all words that contain the same…
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…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…
In 1931, G\"odel presented in K\"onigsberg his famous Incompleteness Theorem, stating that some true mathematical statements are unprovable. Yet, this result gives us no idea about those independent (that is, true and unprovable)…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
This is an examination, a commentary, of links between some philosophical views ascribed to G\"odel and general proof theory. In these views deduction is of central concern not only in predicate logic, but in set theory too, understood from…
The paper provides the proof of the Rimann's conjecture. The results of the works of A. M. Odlyzko and H. te Riile "Disproof of the Conjecture", which gives a disproof of the Mertens hypothesis, using to prove the Riemann's hypothesis. This…
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…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
The fact that the famous Godel incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of logician community.…
Several letters by Kurt G\"odel and Johann (J\'anos) von Neumann from the (so far uncatalogued) archive of Abraham (Adolf) Fraenkel at the National Library of Israel are published and discussed. These include two fragments by G\"odel of…
Frank Wilczek's essay "Total Relativity: Mach 2004" (PHYSICS TODAY April, 2004, p. 10) cogently updates the status of the intuitively compelling, but partly unrealized, theory of Mach's Principle. I think, however, that an important…
Hilbert and Ackermann asked for a method to consistently extend incomplete theories to complete theories. G\"odel essentially proved that any theory capable of encoding its own statements and their proofs contains statements that are true…
This paper surveys results related to well-known works of B. Plotkin and V. Remeslennikov on the edge of algebra, logic and geometry. We start from a brief review of the paper and motivations. The first sections deal with model theory. In…
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,…
Asaf Karagila pointed out that Remark 3.4 [1], directly contradicts Theorem 3.3 (c) [2] which was incorrectly stated. This note contains a proof of this remark. [1] Miller, Arnold W.; A Dedekind Finite Borel Set, Arch. Math. Logic 50…