A minimal degree -- A minimal degree [script bold]m [less than symbol] 02 -- A minimal degree such that [italic]m2 = 02 -- Minimal degrees and the jump operator -- A minimal degree [script bold]m [less than symbol] [script bold]a r.e. -- A minimal degree such that [script bold]m [set theoretic union symbol] [script bold]a [bold]r.e. = 02
Summary
For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of an existence theorem for minimal degrees
Notes
Ph. D. University of California, Berkeley 1973
Bibliography
Includes bibliographical references (page 131), index, and notes added in proof
