Related papers: The Surprise Examination Paradox and the Second In…
For which choices of $X,Y,Z\in\{\Sigma^1_1,\Pi^1_1\}$ does no sufficiently strong $X$-sound and $Y$-definable extension theory prove its own $Z$-soundness? We give a complete answer, thereby delimiting the generalizations of G\"odel's…
Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable.…
Recently, the educational initiative TED-Ed has published a popular brain teaser coined the 'frog riddle', which illustrates non-intuitive implications of conditional probabilities. In its intended form, the frog riddle is a reformulation…
We investigate relationships between versions of derivability conditions for provability predicates. We show several implications and non-implications between the conditions, and we discuss unprovability of consistency statements induced by…
The concept of informal mathematical proof considered in intuitionism is apparently vulnerable to a version of the liar paradox. However, a careful reevaluation of this concept reveals a subtle error whose correction blocks the…
For Kolmogorov test we find natural conditions of uniform consistency of sets of alternatives approaching to hypothesis. Sets of alternatives can be defined both in terms of distribution functions and in terms of densities.
A meta-complexity assumption, Feasible Chaitin Incompleteness (FCI), asserts the hardness of ruling out length $t$ proofs that string $x$ is Kolmogorov random (e.g. $x{\in}R$), by analogy to Chaitin's result that proving $x{\in}R$ is…
This paper engages the question "Does the consistency of a set of axioms entail the existence of a model in which they are satisfied?" within the frame of the Frege-Hilbert controversy. The question is related historically to the…
In our previous work "Characterization of certain homorphic geodesic cycles on Hermitian locally symmetric manifolds of the noncompact type" in "Modern methods in Complex Analysis" Annals of Math. Studies 138 (1995) 85-118, we formulated a…
We analyze the experiment recently realized by S. Afshar et al. [1] in order to refute the principle of complementarity. We discuss the general meaning of this principle and show that contrarily to the claim of the authors Bohr's…
This is the transcript of a lecture given at UMass-Lowell in which I compare and contrast the work of Godel and of Turing and my own work on incompleteness. I also discuss randomness in physics vs randomness in pure mathematics.
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
Problems with uniform probabilities on an infinite support show up in contemporary cosmology. This paper focuses on the context of inflation theory, where it complicates the assignment of a probability measure over pocket universes. The…
In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…
Paradoxes are a very frequent phenomenon in processes of thought which strive towards the intelectual and cognitive shifts. They occur in all areas of human spiritual activites. What we are interested here in, are the paradoxes in physics.…
We unify Godel's First Incompleteness Theorem (1931), Tarski's Undefinability Theorem (1933), Godel-Carnap's Diagonal Lemma (1934), and Rosser's (strengthening of Godel's first) Incompleteness Theorem (1936), whose proofs resemble much and…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
After examining the {\bf P} versus {\bf NP} problem against the Kleene-Rosser paradox of the $\lambda$-calculus [94], it was found that it represents a counter-example to NP-completeness. We prove that it contradicts the proof of Cook's…
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit…
Many writers have observed that default logics appear to contain the "lottery paradox" of probability theory. This arises when a default "proof by contradiction" lets us conclude that a typical X is not a Y where Y is an unusual subclass of…