A note on universal sets

DOI10.2307/2269692zbMath0239.02021OpenAlexW2077783082MaRDI QIDQ5650676

Alistair H. Lachlan

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees, 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, Some reducibilities and splittings of recursively enumerable sets, Computably enumerable sets and related issues, On complete btt-degrees, Truth tabular degrees of recursively enumerable sets, Kolmogorov entropy in the context of computability theory, On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers, Recursively enumerable sets and degrees, On \(m\)-degrees of recursively enumerable sets, On nonprincipal enumerations, On inseparable pairs, Relations between reducibilities of table type, Strong reducibilities, Classes bounded by incomplete sets, Bounded Immunity and Btt-Reductions