arXiv · math/0606713
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.
Explore related subjects
Keep this discovery
Paola Cattabriga. 2006-06-28. Beyond Undecidable. https://arxiv.org/abs/math/0606713
Cite the original work for its findings. Save a collection to share your selection of sources.