A note on universal sets

DOI10.2307/2269692MaRDI QIDQ5650676zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(19)

• 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
• Kolmogorov entropy in the context of computability theory
• On bQ₁-degrees of c.e. sets
• Computably enumerable sets and related issues
• Relations between reducibilities of table type

This page was built for publication: A note on universal sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650676)