相关论文: Godel's theorem is invalid

In Mathematics is common to make a mistake and therefore a false conclusion arises. In each case it is important to recognize the mistake in order to avoid a similar one in the future. Geometric figures provide decisive help in order to…

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

Transcript of G.J. Chaitin's 2 March 2000 Carnegie Mellon University School of Computer Science Distinguished Lecture. The notion of randomness is taken from physics and applied to pure mathematics in order to shed light on the…

These five lectures on undecidability were given to students with a good level in mathematics but with no special knowledge on logic. The first conference presents the formalization of mathematics with a short historical survey, the…

We consider a typical integration of induction in saturation-based theorem provers and investigate the effects of Skolem symbols occurring in the induction formulas. In a practically relevant setting we establish a Skolem-free…

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…

We study the effective versions of several notions related to incompleteness, undecidability and inseparability along the lines of Pour-El's insights. Firstly, we strengthen Pour-El's theorem on the equivalence between effective essential…

This is a paper for a special issue of the journal "Studia Semiotyczne" devoted to Stanislaw Krajewski's paper [30]. This paper gives some supplementary notes to Krajewski's [30] on the Anti-Mechanist Arguments based on G\"{o}del's…

In this short note, we will give the key point of the section conjecture of Grothendieck, that is reformulated by monodromy actions. Here, we will also give the result of the section conjecture for algebraic schemes over a number field.

Mermin states in a recent paper that his nontechnical version of Bell's theorem stands and is not invalidated by time and setting dependent instrument parameters as claimed in one of our previous papers. We identify a number of…

We consider the decidability of the verification problem of programs \emph{modulo axioms} --- that is, verifying whether programs satisfy their assertions, when the functions and relations it uses are assumed to interpreted by arbitrary…

The Hodge conjecture is shown to be equivalent to a question about the homology of very ample divisors with ordinary double point singularities. The infinitesimal version of the result is also discussed.

This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…

Musta\c{t}\u{a} a and Popa introduce the notion of Hodge ideals for an effective $\mathbb{Q}$-divisor $D$ and prove a vanishing theorem for Hodge ideals, which generalizes Nadel vanishing for multiplier ideals. However, their proof needs an…

An overview of the experimental and observational status in gravitational physics is given, both for the known tests of general relativity and Newtonian gravity, but also for the increasing number of results where these theories run into…

A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with…

This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…

G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…

Serious mathematical defect in the important kinematics theorem known in continuum mechanics as Convection (or Transport) Theorem is reported. We claim that the traditional demonstration does not take into account a special constraint on…

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…