Beyond Goedel : Simply consistent constructive systems of first order Peano's Arithmetic that do not yield undecidable propositions by Goedel's reasoning

Details Beyond Goedel : Simply consistent constructive systems of first order Peano's Arithmetic that do not yield undecidable propositions by Goedel's reasoning Beyond Goedel : Simply consistent constructive systems of first order Peano's Arithmetic that do not yield undecidable propositions by Goedel's reasoning

2002-01-08

arxiv.org/abs/math/0201059v2

Mathematics

General Mathematics

63 pages. Also available at http://alixcomsi.com/index01.htm; added abstract; substituted recursive definition for omega-const

Scientific paper

In this paper, we argue that formal systems of first order Arithmetic that admit Goedelian undecidable propositions validly are abnormally non-constructive. We argue that, in such systems, the strong representation of primitive recursive predicates admits abnormally non-constructive, Platonistic, elements into the formal system that are not reflected in the predicates which they are intended to formalise. We argue that the source of such abnormal Platonistic elements in these systems is the non-constructive Generalisation rule of inference of first order logic. We argue that, in most simply consistent systems that faithfully formalise intuitive Arithmetic, we cannot infer from Goedel's reasoning the Platonistic existence of abnormally non-constructive propositions that are formally undecidable, but true under every interpretation. We define a constructive formal system of Peano's Arithmetic, omega2-PA, whose axioms are identical to the axioms of standard Peano's Arithmetic PA, but lead to significantly different logical consequences. We thus argue that the formal undecidability of true Arithmetical propositions is a characteristic not of relations that are Platonistically inherent in any Arithmetic of the natural numbers, but of the particular formalisation chosen to represent them.

Affiliated with

Also associated with

No associations

Rating

Beyond Goedel : Simply consistent constructive systems of first order Peano's Arithmetic that do not yield undecidable propositions by Goedel's reasoning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Beyond Goedel : Simply consistent constructive systems of first order Peano's Arithmetic that do not yield undecidable propositions by Goedel's reasoning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Beyond Goedel : Simply consistent constructive systems of first order Peano's Arithmetic that do not yield undecidable propositions by Goedel's reasoning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124224