Cargando…

A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /

Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.In A Hierarchy of...

Descripción completa

Detalles Bibliográficos
Clasificación:	Libro Electrónico
Autores principales:	Downey, Rod (Autor), Greenberg, Noam (Autor)
Formato:	Electrónico eBook
Idioma:	Inglés
Publicado:	Princeton, NJ : Princeton University Press, [2020]
Colección:	Annals of Mathematics Studies ; 382
Temas:	Computable functions. Recursively enumerable sets. Unsolvability (Mathematical logic) Unsolvability (Mathematical logic). MATHEMATICS / Logic. Recursion theory. c.e. degrees. c.e. reals. computable model theory. lattice embeddings. m-topped degrees. mind changes in computability theory. modern computability theory. pi-zero-one classes. prompt permissions. relative recursive randomness. transfinite hierarchy of Turing degrees.
Acceso en línea:	Texto completo Texto completo

Internet

Texto completo
Texto completo

Items no disponibles

A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /

Internet

Ejemplares similares