From Bi-Immunity to Absolute Undecidability

DOI10.2178/jsl.7804120zbMath1349.03044arXiv1210.4937OpenAlexW2170506950MaRDI QIDQ5407050

Adam R. Day, Rupert Hölzl, Laurent Bienvenu

Publication date: 4 April 2014

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

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

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Other Turing degree structures (03D28)

Related Items (8)

Asymptotic density, computable traceability, and 1-randomness ⋮ Asymptotic density, immunity and randomness ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Bi-immunity over different size alphabets ⋮ A new quantum random number generator certified by value indefiniteness ⋮ Asymptotic density and the coarse computability bound ⋮ Generic case completeness ⋮ Asymptotic density and computability

This page was built for publication: From Bi-Immunity to Absolute Undecidability