NON-SPLITTINGS OF SPEEDABLE SETS
From MaRDI portal
Publication:5501773
DOI10.1017/jsl.2014.83zbMath1436.03221arXiv1410.1986OpenAlexW2962723577MaRDI QIDQ5501773
Publication date: 14 August 2015
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.1986
Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)
Cites Work
This page was built for publication: NON-SPLITTINGS OF SPEEDABLE SETS