A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability /
"This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now h...
Call Number: | Libro Electrónico |
---|---|
Main Authors: | Downey, R. G. (Rod G.) (Author), Greenberg, Noam, 1974- (Author) |
Format: | Electronic eBook |
Language: | Inglés |
Published: |
Princeton :
Princeton University Press,
2020.
|
Series: | Annals of mathematics studies ;
no. 206, 385. |
Subjects: | |
Online Access: | Texto completo |
Similar Items
-
Minimal weak truth table degrees and computably enumerable Turing degrees /
by: Downey, R. G. (Rod G.), et al.
Published: (2020) -
The role of true finiteness in the admissible recursively enumerable degrees /
by: Greenberg, Noam, 1974-
Published: (2006) -
Degrees of unsolvability /
by: Gerald E. Sacks
Published: (1066) -
Minimal degrees of unsolvability and the full approximation construction /
by: Epstein, Richard L., 1947-
Published: (1975) -
Automorphisms of the lattice of recursively enumerable sets /
by: Cholak, Peter, 1962-
Published: (1995)