On a question of Slaman and Groszek

DOI10.1090/S0002-9939-08-09345-3MaRDI QIDQ3533885zbMATH OpenOpenAlexFDO

Authors 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

hyperimmunenon-computable pathsnon-computable perfect treeTuring degree

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Recommendations

• The computable dimension of trees of infinite height
• Products of Infinitely Many Perfect Trees
• Computability in uncountable binary trees
• Reals n-generic relative to some perfect tree
• Self-embeddings of computable trees

Cites work

• A Basis Theorem for Perfect Sets
• A random degree with strong minimal cover
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• One hundred and two problems in mathematical logic
• Π10 classes, strong minimal covers and hyperimmune-free degrees

Cited in

(4)

• A block triangular nonlinear observer normal form
• Computability in uncountable binary trees
• Forcing with bushy trees
• Growth and irreducibility in path-incompressible trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533885)