Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-25T06:45:18.159Z Has data issue: false hasContentIssue false

On the completeness of some transfinite recursive progressions of axiomatic theories

Published online by Cambridge University Press:  12 March 2014

Jens Erik Fenstad*
Affiliation:
University of Oslo

Extract

The well-known incompleteness results of Gödel assert that there is no recursively enumerable set of sentences of formalized first order arithmetic which entails all true statements of that theory. It is equally well known that by introducing sufficiently nonconstructive rules, such as the ω-rule of induction, completeness can be re-established.

Starting from the work of Turing [4] Feferman in [1] developed another method, viz. the study of transfinite recursive progressions of theories, for closing the gap between Gödel (recursively enumerable sets of axioms yield incompleteness) and Tarski (number-theoretic truth is not arithmetically definable).

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.)

References

[1]Feferman, S., Transfinite recursive progressions of axiomatic theories, this Journal, vol. 27 (1962), pp. 259316.Google Scholar
[2]Kreisel, G., Shoenfield, J. and Wang, H., Number-theoretic concepts and recursive wellorderings, Archie für Mathematische Logik und Grundlagenforschung, vol. 5 (1960), pp. 4264.CrossRefGoogle Scholar
[3]Shoenfield, J., On a restricted ω-rule, Bulletin de l' Academie Polonaise des Sciences, vol. 7 (1959), pp. 405407.Google Scholar
[4]Turing, A. M., Systems of logic based on ordinals, Proceedings of the London Mathematical Society, sec. 2, vol. 45 (1939), pp. 161228.CrossRefGoogle Scholar