A note on universal sets
From MaRDI portal
Publication:5650676
DOI10.2307/2269692zbMath0239.02021MaRDI QIDQ5650676
Publication date: 1966
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2269692
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Kolmogorov entropy in the context of computability theory, Computably enumerable sets and related issues, Relations between reducibilities of table type, Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I, Structures of the degrees of unsolvability of index sets, Several results on upper semilattices and m-degrees, On complete btt-degrees, Truth tabular degrees of recursively enumerable sets, On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers, Classes bounded by incomplete sets, Some reducibilities and splittings of recursively enumerable sets, On \(m\)-degrees of recursively enumerable sets, On nonprincipal enumerations, On inseparable pairs, Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees, Strong reducibilities, Recursively enumerable sets and degrees, Bounded Immunity and Btt-Reductions