The semilattice of computable families of recursively enumerable sets

DOI10.1007/BF01137732MaRDI QIDQ684511zbMATH OpenOpenAlexFDO

Authors A. N. Degtev

Publication date 26 September 1993

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

computable families of r.e. setsdecreasable familiesideallattice

Mathematics Subject Classification ID

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

Cites work

• Classes of Recursively Enumerable Sets and Their Decision Problems

Cited in

(6)

• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Semilinear sets and counter machines: a brief survey
• Almost computably enumerable families of sets
• scientific article; zbMATH DE number 24993 (Why is no real title available?)
• scientific article; zbMATH DE number 535104 (Why is no real title available?)
• scientific article; zbMATH DE number 3995654 (Why is no real title available?)

This page was built for publication: The semilattice of computable families of recursively enumerable sets

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