Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T19:22:33.727Z Has data issue: false hasContentIssue false

Diagonalization in degree constructions

Published online by Cambridge University Press:  12 March 2014

D. Posner
Affiliation:
University of California, Berkeley, California 94720
R. Epstein
Affiliation:
Victoria University, Wellington, New Zealand

Extract

We present two theorems whose applications are to eliminate diagonalization arguments from a variety of constructions of degrees of unsolvability.

All definitions and notations come from [1, Chapter 1]. We give a brief resumé of them here.

We identify a set with its characteristic function. (A(x)= 1 if xA and A (x) = 0 if xA.) A string σ is the restriction of a characteristic function to a finite initial segment of natural numbers, lh(σ) = length of σ = n + 1 if σ = A[n] for some set A. (A [n] is the restriction of A to {m: mn}.) If i = 0 or 1, σ * i is defined as the string of length lh(σ) + 1 such that σ * i ⊇ σ and σ * i(lh(σ)) = i. We write σ ∣ τ if σ ⊉ τ and τ ⊉ σ.

n} is a listing of the partial recursive functionals. We write “ATB” (“A is Turing reducible to B”) if ∃nxΦn(B)(x) = A(x).

A partial function, T, from strings to strings is a tree if T is order preserving and for all strings, σ, if one of T(σ * 0), T(σ * 1) is defined then T(σ), T(σ * 0), T(σ * 1) are all defined and T(σ * 0)∣(σ * 1).

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1978

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]Epstein, R., Minimal degrees of unsolvability and the full approximation construction, Memoirs of the American Mathematical Society, no. 162, 1975.Google Scholar
[2]Lachlan, A. H. and Lebeuf, R., Countable initial segments of the degrees of unsolvability, this Journal, vol. 41 (1976), pp. 289300.Google Scholar
Yates, C. E. M., Initial segments of the degrees of unsolvability, Part II: Minimal degrees, this Journal, vol. 35 (1970), pp. 243266.Google Scholar