Related papers: Goedel's Incompleteness Theorem
Recent announcements from frontier AI model labs have highlighted strong results on high-school and undergraduate math competitions. Yet it remains unclear whether large language models can solve new, simple conjectures in more advanced…
We develop a semantics for logics of imperfect information with respect to general models. Then we build a proof system and prove its soundness and completeness with respect to this semantics.
Is it possible to encompass the full extent of the universe within a theory based on a finite set of first principles and inference rules? The r\^{o}le of observers and observations in physics theories is considered here in the light of…
Recent reports claim that Large Language Models (LLMs) have achieved the ability to derive new science and exhibit human-level general intelligence. We argue that such claims are not rigorous scientific claims, as they do not satisfy…
This is the first in a series of three papers on Algebraic Set Theory. Its main purpose is to lay the necessary groundwork for the next two parts, one on Realisability and the other on Sheaf Models in Algebraic Set Theory.
The first version of this paper gave another proof of the Kropholler Conjecture, which gives a relative version of Stallings Ends Theorem, following an earlier incorrect proof. It has been pointed out by Sam Shepherd that the the second…
It is shown that the Einstein-Podolsky-Rosen conclusion concerning the `incompleteness' of Quantum Mechanics is invalidated by two logical errors in their argument. If it were possible to perform the proposed gedanken experiment it would,…
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…
Different from the view that information is objective reality, this paper adopts the idea that all information needs to be compiled by the interpreter before it can be observed. From the traditional complexity definition, this paper defines…
The 20th century has revealed two important limitations of scientific knowledge. On the one hand, the combination of Poincar\'e's nonlinear dynamics and Heisenberg's uncertainty principle leads to a world picture where physical reality is,…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
Formal, automated theorem proving has long been viewed as a challenge to artificial intelligence. We introduce here a new approach to computer theorem proving, one that employs specialized language models for Lean4 proof generation combined…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
In this paper we present a new proof of Solovay's theorem on arithmetical completeness of G\"odel-L\"ob provability logic GL. Originally, completeness of GL with respect to interpretation of $\Box$ as provability in PA was proved by R.…
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…
We have published several articles about generalizations and boundary-case exceptions to the Second Incompleteness Theorem during the last 25 years. The current paper will review some of our prior results and also introduce an `enriched'…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…
It has been commonly argued, on the basis of Goedel's theorem and related mathematical results, that true artificial intelligence cannot exist. Penrose has further deduced from the existence of human intelligence that fundamental changes in…
We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice…