Metarecursive sets

Journal of Symbolic Logic 30 (3):318-338 (1965)
  Copy   BIBTEX

Abstract

Our ultimate purpose is to give an axiomatic treatment of recursion theory sufficient to develop the priority method. The direct or abstract approach is to keep in mind as clearly as possible the methods actually used in recursion theory, and then to formulate them explicitly. The indirect or experimental approach is to look first for other mathematical theories which seem similar to recursion theory, to formulate the analogies precisely, and then to search for an axiomatic treatment which covers not only recursion theory but also the analogous theories as particular cases.The first approach is more general because it does not depend on the existence of analogues. A concrete mathematical theory, it seems, need have no such analogues and still be important, as e.g. classical number theory. In such a case, an axiomatic treatment may still be useful for exhibiting the mathematical structure of the theory considered and the assumptions on which it rests. However, it will lack one of the most heavily advertised advantages of the axiomatic method, namely, the “economy of thought” which results from an uniform theory for several different and interesting cases: we cannot hope for this if, by hypothesis, we know of only one particular case. In contrast, the second approach, if successful at all, is bound to achieve such “economy” because we start out with several interesting particular cases. Another possible virtue of the second approach is that of field work over insight: the abstract pattern that we are looking for and hoping to formalize in axioms, may not be evident in any one mathematical theory, but may spring to the eye if one happens to look simultaneously at several theories which happen to realize the pattern.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A new symbolic representation for the algebra of sets.Jerome Frazee - 1990 - History and Philosophy of Logic 11 (1):67-75.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
Orbits of hyperhypersimple sets and the lattice of ∑03 sets.E. Herrmann - 1983 - Journal of Symbolic Logic 48 (3):693 - 699.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.

Analytics

Added to PP
2009-01-28

Downloads
37 (#420,900)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
Minimal α-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393-414.
Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
Atomic models higher up.Jessica Millar & Gerald E. Sacks - 2008 - Annals of Pure and Applied Logic 155 (3):225-241.

View all 17 citations / Add more citations

References found in this work

Theory of Formal Systems.Raymond M. Smullyan - 1965 - Journal of Symbolic Logic 30 (1):88-90.
Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.

Add more references