On a question of Slaman and Groszek

DOI10.1090/S0002-9939-08-09345-3zbMath1155.03024OpenAlexW2005838908MaRDI QIDQ3533885

Andrew E. M. Lewis

Publication date: 24 October 2008

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-08-09345-3

zbMATH Keywords

Turing degreehyperimmunenon-computable pathsnon-computable perfect tree

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (1)

A block triangular nonlinear observer normal form

Cites Work

• Unnamed Item
• Unnamed Item
• One hundred and two problems in mathematical logic
• A Basis Theorem for Perfect Sets
• A random degree with strong minimal cover
• Π10 classes, strong minimal covers and hyperimmune-free degrees

This page was built for publication: On a question of Slaman and Groszek