Isomorphism of lattices of recursively enumerable sets

DOI10.1090/S0002-9947-97-01604-8zbMath0870.03017OpenAlexW1484985442MaRDI QIDQ4337954

Todd Hammond

Publication date: 27 May 1997

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-97-01604-8

zbMATH Keywords

oraclerecursively enumerable setsTuring jumpeffective embeddingeffective isomorphism

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Theory of Formal Systems. (AM-47)
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Nonisomorphism of lattices of recursively enumerable sets
• On the Lattice of Recursively Enumerable Sets
• Hierarchies of Boolean algebras

This page was built for publication: Isomorphism of lattices of recursively enumerable sets