The semilattice of computable families of recursively enumerable sets

DOI10.1007/BF01137732zbMath0781.03030OpenAlexW2042948325MaRDI QIDQ684511

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

latticeidealcomputable families of r.e. setsdecreasable families

Mathematics Subject Classification ID

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

Related Items (1)

Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)

Cites Work

• Classes of Recursively Enumerable Sets and Their Decision Problems

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