Limits to joining with generics and randoms

DOI10.1142/9789814449274_0004zbMath1364.03057arXiv1209.3282OpenAlexW2326799362MaRDI QIDQ5737985

Damir D. Dzhafarov, Adam R. Day

Publication date: 31 May 2017

Published in: Proceedings of the 12th Asian Logic Conference (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Other Turing degree structures (03D28)

Related Items (3)

HIGHER RANDOMNESS AND GENERICITY ⋮ Generics for computable Mathias forcing ⋮ Decomposing Borel functions using the Shore–Slaman join theorem

This page was built for publication: Limits to joining with generics and randoms