Isomorphism of lattices of recursively enumerable sets
From MaRDI portal
Publication:4337954
DOI10.1090/S0002-9947-97-01604-8zbMATH Open0870.03017OpenAlexW1484985442MaRDI QIDQ4337954FDOQ4337954
Authors: 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
Recommendations
- Nonisomorphism of lattices of recursively enumerable sets
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Congruence relations on lattices of recursively enumerable sets
- Definable structures in the lattice of recursively enumerable sets
Cites Work
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Title not available (Why is that?)
- Theory of Formal Systems. (AM-47)
- Hierarchies of Boolean algebras
- On the Lattice of Recursively Enumerable Sets
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Nonisomorphism of lattices of recursively enumerable sets
Cited In (8)
- The isomorphism class of a set of lattices
- Nonisomorphism of lattices of recursively enumerable sets
- The lattice of recursively enumerable substructures of an effective closure system
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets
- Title not available (Why is that?)
- Congruence relations on lattices of recursively enumerable sets
- Definable structures in the lattice of recursively enumerable sets
This page was built for publication: Isomorphism of lattices of recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337954)
