PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability (Q6475724)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability |
preprint article from arXiv |
Statements
3 July 2005
0 references
math.GM
0 references
Bhupinder Singh Anand
0 references
