Does Gödel’s First Incompleteness Theorem imply the inconsistency of Platonic Infinity?

But Gödel’s First Incompleteness Theorem also proves that the very notion of Actual infinity in terms of Platonism (which is also Actual infinity in terms of Cantor) does not hold logically.

What does Gödel’s incompleteness theorem imply?

Gödel’s first incompleteness theorem says that if you have a consistent logical system (i.e., a set of axioms with no contradictions) in which you can do a certain amount of arithmetic 4, then there are statements in that system which are unprovable using just that system’s axioms.

Is Gödel’s incompleteness theorem false?

A common misunderstanding is to interpret Gödel’s first theorem as showing that there are truths that cannot be proved. This is, however, incorrect, for the incompleteness theorem does not deal with provability in any absolute sense, but only concerns derivability in some particular formal system or another.

Is peano arithmetic consistent?

The simplest proof that Peano arithmetic is consistent goes like this: Peano arithmetic has a model (namely the standard natural numbers) and is therefore consistent. This proof is easy to formalize in ZFC, so it’s certainly a proof by the ordinary standards of everyday mathematics.

What did Gödel prove?

Gödel showed that the augmented axiomatic system will allow the construction of a new, true formula Gʹ (according to a similar blueprint as before) that can’t be proved within the new, augmented system. In striving for a complete mathematical system, you can never catch your own tail.

See also  Entailment/Presupposition in if-clause

Can a formal system be inconsistent?

A formal system (deductive system, deductive theory, . . .) S is said to be inconsistent if there is a formula A of S such that A and its negation, lA, are both theorems of this system. In the opposite case, S is called consistent. A deductive system S is said to be trivial if all its formulas are theorems.

Is Pennsylvania consistent?

Peano Arithmetic, PA, is a formal first-order theory containing constant 0, functions / (successor), +, ×, and the usual recursive identities for these functions.

When was Gödel’s incompleteness theorem?


In 1931, the Austrian logician Kurt Gödel published his incompleteness theorem, a result widely considered one of the greatest intellectual achievements of modern times.

What did Alonzo Church prove?

Mathematical work

Church is known for the following significant accomplishments: His proof that the Entscheidungsproblem, which asks for a decision procedure to determine the truth of arbitrary propositions in a first-order mathematical theory, is undecidable. This is known as Church’s theorem.

Why is the incompleteness theorems important?

To be more clear, Gödel’s incompleteness theorems show that any logical system consists of either contradiction or statements that cannot be proven. These theorems are very important in helping us understand that the formal systems we use are not complete.

Is first order logic complete?

Perhaps most significantly, first-order logic is complete, and can be fully formalized (in the sense that a sentence is derivable from the axioms just in case it holds in all models). First-order logic moreover satisfies both compactness and the downward Löwenheim-Skolem property; so it has a tractable model theory.

See also  Best order to read David Lewis