相关论文: Godel's theorem is invalid

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…

We re-examine the old question to what extent mathematics may be compared with a game. Mainly inspired by Hilbert and Wittgenstein, our answer is that mathematics is something like a rhododendron of language games, where the rules are…

In this paper, we provide a complete classification for the first-order Goedel logics concerning the property that the formulas admit logically equivalent prenex normal forms. We show that the only first-order Goedel logics that admit such…

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…

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 studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

A very short proof of G\"odel's second incompleteness theorem (for set theory, second order arithmetic etc.)

In this paper, we give a detailed account of Goldfeld's proof of Siegel's theorem. Particularly, we present complete proofs of the nontrivial assumptions made in his paper.

The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…

While it is widely agreed that Bell's theorem is an important result in the foundations of quantum physics, there is much disagreement about what exactly Bell's theorem shows. It is agreed that Bell derived a contradiction with experimental…

Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in…

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

We give a proof of the inconsistency of PM arithmetic, classical set theory and related systems, incidentally exposing an error in Goedel's own proof of Goedel's Theorems. The inconsistency proof, that formulae of the form R and ~R occur as…

Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…

Cox's well-known theorem justifying the use of probability is shown not to hold in finite domains. The counterexample also suggests that Cox's assumptions are insufficient to prove the result even in infinite domains. The same…

We point out that some questions in quantum field theory are undecidable in a precise mathematical sense. More concretely, it will be demonstrated that there is no algorithm answering whether a given 2d supersymmetric Lagrangian theory…

In the paper it is demonstrated that Bells theorem is an unprovable theorem.

In this paper we briefly review and analyze three published proofs of Chaitin's theorem, the celebrated information-theoretic version of G\"odel's incompleteness theorem. Then, we discuss our main perplexity concerning a key step common to…

A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…

We argue by using Godel's incompletness theorems in logic that platonism is the best metaphysics for science. This is based on the fact that a natural law in a platonic metaphysics represents a timeless order in the motion of matter, while…