Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T08:39:43.791Z Has data issue: false hasContentIssue false

Countable initial segments of the degrees of unsolvability

Published online by Cambridge University Press:  12 March 2014

A. H. Lachlan
Affiliation:
Simon Fraser University, Burnaby 2, British Columbia, Canada
R. Lebeuf
Affiliation:
College Marie-Victorin, 7000 Marie-Victorin Montreal, Quebec, Canada

Extract

In this paper we show that any countable upper semilattice with zero can be embedded as an initial segment of the degrees of unsolvability. This provides a characterization of the order types of the countable initial segments of the degrees since any such initial segment is trivially an initial segment of a countable upper semilattice. Let a segment S of the degrees be a set of degrees such that, if a, b Є S and a < c < b, then c Є S. One may readily observe that our result also characterizes the order types of all countable segments of the degrees of unsolvability.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1976

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

[1] Lerman, M., Initial segment of the degrees of unsolvability, Annals of Mathematics, vol. 93 (1971), pp. 365389.CrossRefGoogle Scholar
[2] Lachlan, A. H., Distributive initial segments of the degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 457472.CrossRefGoogle Scholar
[3] Lachlan, A. H., Recursion theory seminar (Warsaw, 1973), mimeographed notes.Google Scholar
[4] Thomason, S. K., Sublattices and initial segments of the degrees of unsolvability, Canadian Journal of Mathematics, vol. 3 (1970), pp. 569581.CrossRefGoogle Scholar