Some properties of the upper semilattice of computable families of computably enumerable sets

DOI10.1007/s10469-021-09635-xOpenAlexW3200155715MaRDI QIDQ2246822

M. Kh. Faizrakhmanov

Publication date: 16 November 2021

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

Full work available at URL: https://doi.org/10.1007/s10469-021-09635-x

zbMATH Keywords

computable numberingcomputably enumerable setcomputable familysemilattice of computable families

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites Work

• Positive enumerations
• Generalized computable universal numberings
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• On the Degrees of Index Sets. II
• Unnamed Item
• Unnamed Item

This page was built for publication: Some properties of the upper semilattice of computable families of computably enumerable sets