Minimal degrees of unsolvability and the full approximation construction /

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 existenc...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Epstein, Richard L., 1947-
Format: Thesis Electronic eBook
Language:Inglés
Published: Providence : American Mathematical Society, 1975.
Series:Memoirs of the American Mathematical Society ; no. 162.
Subjects:
Unsolvability (Mathematical logic)
Recursive functions.
Constructive mathematics.
Non-résolubilité (Logique mathématique)
Fonctions récursives.
Mathématiques constructives.
Constructive mathematics
Recursive functions
dissertations.
Academic theses
Academic theses.
Thèses et écrits académiques.
Online Access:Texto completo
Table of Contents:
  • 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

Similar Items