A note on the join property

DOI10.1090/S0002-9939-2011-10908-0MaRDI QIDQ3116561zbMATH OpenOpenAlexFDO

Authors Andrew E. M. Lewis

Publication date 24 February 2012

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-2011-10908-0

zbMATH Keywords

a.n.r. degreescupping propertyfixed-point-free degreesjoin propertylow degreesPA degreesrandom degreesTuring degree

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Recommendations

• Another note on the join property
• Joining to High Degrees
• Joining to high degrees via noncuppables
• An effectively closed set with no join property*
• Computably enumerable Turing degrees and the meet property

Cites work

• Complementation in the Turing degrees
• Computability and randomness
• Degrees joining to 0′
• Extensions of embeddings below computably enumerable degrees
• Generalized high degrees have the complementation property
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 4008384 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 841084 (Why is no real title available?)
• On the degree spectrum of a ^0_1 class
• The strong anticupping property for recursively enumerable degrees
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(4)

• Randomness below complete theories of arithmetic
• The information content of typical reals
• Another note on the join property
• An effectively closed set with no join property*

This page was built for publication: A note on the join property

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