Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T11:33:14.589Z Has data issue: false hasContentIssue false

Effectively extensible theories1

Published online by Cambridge University Press:  12 March 2014

Marian Boykan Pour-El*
Affiliation:
University of Minnesota

Extract

It is well known that Gödel's famous undecidability result may be viewed in the following strong form. Suppose we are given a specific presentation (i.e., a specific formulation in terms of axioms and rules of inference) of number theory. Then there exists an effective method which, when applied to a consistent axiomatizable extension of the theory yields an undecidable sentence of this extension. For distinct presentations the undecidable sentences obtained would be distinct. This is because the sentence constructed depends upon the notion of proof and hence ultimately upon the axioms and rules of inference—i.e., upon the specific presentation.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1968

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable