RELATIVE DEFINABILITY OF n-GENERICS

DOI10.1017/jsl.2018.62OpenAlexW2964269676MaRDI QIDQ4647098

Wei Wang

Publication date: 4 January 2019

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.08875

zbMATH Keywords

genericTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Relatively computably enumerable reals
• Algorithmic Randomness and Complexity
• Relative recursive enumerability of generic degrees
• Initial segments of the degrees of unsolvability Part II: minimal degrees

This page was built for publication: RELATIVE DEFINABILITY OF n-GENERICS