WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS

DOI10.1017/JSL.2017.73zbMath1447.03007arXiv1711.00153OpenAlexW2963747156MaRDI QIDQ4638993

Linda Brown Westrick

Publication date: 2 May 2018

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

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

zbMATH Keywords

degree theorylattice embeddingScott setgenericityalgorithmic randomness

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• A measure-theoretic proof of Turing incomparability
• Lowness and nullsets
• Turing incomparability in Scott sets

This page was built for publication: WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS