Beyond Undecidable
Paola Cattabriga
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.
Create a lesson
Related papers
A Note on the Measure of Vector and Pythagorean Theorem
Yu. V. Brezhnev
On Weighted Convex Graphs
Angshuman R. Goswami
On characterizations, Decompositions, and Stability of Convex Sequences
Angshuman R. Goswami
New Laplace convolution integrals involving exponential, error, and parabolic cylinder functions with applications in heat transfer and linear viscoelasticity
González Santander, Juan Luis
Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent
Chenxiao Tian
Information Geometry (IG) Lives at Edge or Boundary of SMG (statistically meaningful geometry): - the First Edge Theorem and Applications
Bing Cheng, Yi-Shuai Niu, Howell Tong et al.