PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability
From MaRDI portal
Publication:6475724
arXivmath/0507044MaRDI QIDQ6475724
Author name not available (Why is that?)
Publication date: 3 July 2005
Abstract: We define instantiational and algorithmic completeness for a formal language. We show that, in the presence of Church's Thesis, an alternative interpretation of Goedelian incompleteness is that Peano Arithmetic is instantiationally complete, but algorithmically incomplete. We then postulate a Provability Thesis that links Peano Arithmetic and effective algorithmic computability, just as Church's Thesis links Recursive Arithmetic and effective instantiational computability.
No records found.
This page was built for publication: PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475724)