Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-26T23:38:30.814Z Has data issue: false hasContentIssue false
  • English
  • Français

A metatheorem for constructions by finitely many workers

Published online by Cambridge University Press:  12 March 2014

J. F. Knight
J. F. Knight*
Affiliation:
Department of Mathematics, University of Notre Dame, Notre Dame, Indiana 46556
Get access Rights & Permissions [Opens in a new window]

Extract

The aim of the present paper is to give some general conditions for constructions by finitely many workers. Constructions using infinitely many workers will not be considered here, although there are examples of such constructions. The original construction using the method of workers, due to Harrington [H], has a worker n for each n ∈ ω, as do the constructions in [K1] and [K2]. Marker [M] obtains a result using three workers. In [AJK], there are two constructions that use three workers. There are also two constructions that have, for an arbitrary recursive ordinal α, one worker for each β < α.

The main result here is a metatheorem, which is patterned after Proposition 1 of Ash [A]. As in [A], the object of the construction is to attach “labels” to the nodes in a highly nonrecursive path through a tree, while recursively enumerating neighborhoods of an “adherent” point in a metric space. There is a family of relations associated with the labels, and the metatheorem here and the one in [A] both say that the construction will succeed if these relations satisfy a list of properties. There are significant differences between the result here and that in [A]. One difference is that certain relations which in [A] were required to be r.e. need not be r.e. here. Another difference is that there are extra relations here, and as a result, the list of properties to be satisfied is longer and more horrible than that in [A].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 55 , Issue 2 , June 1990 , pp. 787 - 804
Copyright
Copyright © Association for Symbolic Logic 1990

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

REFERENCES

[A[Ash, C. J., Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees, Transactions of the American Mathematical Society, vol. 298 (1986), pp. 497–514; corrections, C. J. Ash, Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees, Transactions of the American Mathematical Society, vol. 310 (1988), p. 851.CrossRefGoogle Scholar
[AJK[Ash, C. J., Jockusch, C. G., and Knight, J. F., Jumps of orderings, Transactions of the American Mathematical Society (to appear).Google Scholar
[AK[Ash, C. J. and Knight, J. F., Pairs of structures, Annals of Pure and Applied Logic (to appear).Google Scholar
[H[Harrington, L., Building nonstandard models of Peano arithmetic, handwritten notes, 1799.Google Scholar
[K1[Knight, J. F., Effective construction of models, Logic Colloquium '84 (Paris, J.et al., editors), North-Holland, Amsterdam, 1986, pp. 105–119.CrossRefGoogle Scholar
[K2]Knight, J. F., Degrees of models with prescribed Scott set, Classification theory (proceedings, Chicago, 1985; Baldwin, J., editor), Lecture Notes in Mathematics, vol. 1292, Springer-Verlag, Berlin, 1988, pp. 182–191.Google Scholar
[M[Marker, D., Degrees of models of true arithmetic, Proceedings of the Herhrand symposium (Stern, J., editor), North-Holland, Amsterdam, 1982, pp. 233–242.CrossRefGoogle Scholar
[MM[Macintyre, A. and Marker, D., Degrees of recursively saturated models, Transactions of the American Mathematical Society, vol. 282 (1984), pp. 539–554.CrossRefGoogle Scholar
[O[Oates, S., Jump degrees of groups, Ph.D. thesis, University of Notre Dame, Notre Dame, Indiana, 1989.Google Scholar