The lattice of recursively enumerable substructures of an effective closure system

DOI10.1007/BF00739411MaRDI QIDQ1918795zbMATH OpenOpenAlexFDO

Authors S. L. Shokhor

Publication date 15 October 1996

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00739411

zbMATH Keywords

\(r\)-maximal subalgebraslattice of r.e. setslattice of superstructuresr.e. degreesrecursive Boolean algebrarecursive substructure of an effective closure system

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• scientific article; zbMATH DE number 4035813
• scientific article; zbMATH DE number 3914305
• Automorphisms of substructure lattices in recursive algebra
• Isomorphism of lattices of recursively enumerable sets
• scientific article; zbMATH DE number 4097358

Cites work

• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• scientific article; zbMATH DE number 4035813 (Why is no real title available?)
• On the Lattice of Recursively Enumerable Sets
• Recursion theory on algebraic structures with independent sets

Cited in

(6)

• Automorphisms of substructure lattices in recursive algebra
• Subrecursive equivalence relations and (non-)closure under lattice operations
• Enumeration of support-closed subsets in confluent systems
• scientific article; zbMATH DE number 3914305 (Why is no real title available?)
• scientific article; zbMATH DE number 4035813 (Why is no real title available?)
• Recursive properties of relations on models

This page was built for publication: The lattice of recursively enumerable substructures of an effective closure system

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