Beyond Undecidable
Abstract
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness and decidability with regard to Peano Arithmetic and the first order predicate calculus.
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- June 2006
- DOI:
- 10.48550/arXiv.math/0606713
- arXiv:
- arXiv:math/0606713
- Bibcode:
- 2006math......6713C
- Keywords:
-
- Mathematics - General Mathematics;
- 03Bxx;
- 03A05;
- 03B70
- E-Print:
- 9 pages, for more information see http://it.geocities.com/paola_cattabriga/