The degrees of bi‐immune sets
From MaRDI portal
Publication:5575556
DOI10.1002/malq.19690150707zbMath0184.02002OpenAlexW2012759418MaRDI QIDQ5575556
Publication date: 1969
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19690150707
Related Items (20)
Co-immune subspaces and complementation inV∞ ⋮ Randomness and universal machines ⋮ On the classification of recursive languages ⋮ The degrees of bi-hyperhyperimmune sets ⋮ Numberings, c.e. oracles, and fixed points ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Lowness, Randomness, and Computable Analysis ⋮ Ramsey's theorem and recursion theory ⋮ Automorphism bases for degrees of unsolvability ⋮ ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS ⋮ The Halting Problem Relativized to Complements ⋮ Notions of weak genericity ⋮ Weak reducibility of computable and generalized computable numberings ⋮ Asymptotic density and the coarse computability bound ⋮ Degree spectra and immunity properties ⋮ Calibrating Randomness ⋮ Classification from a Computable Viewpoint ⋮ Degrees of sets having no subsets of higher m- and t t-degree ⋮ Diagonally Non-Computable Functions and Bi-Immunity ⋮ Π10 classes and Boolean combinations of recursively enumerable sets
This page was built for publication: The degrees of bi‐immune sets
