Almost computably enumerable families of sets

DOI10.1070/SM2008V199N10ABEH003967zbMath1162.03022OpenAlexW2109529784MaRDI QIDQ3600774

Iskander Sh. Kalimullin

Publication date: 5 February 2009

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm2008v199n10abeh003967

zbMATH Keywords

measuredegree spectrumalmost c.e. familyc.e. familycomputably enumerable family

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (8)

11th Asian Logic Conference ⋮ Punctual structures and primitive recursive reducibility ⋮ THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ Degree spectra of structures relative to equivalences ⋮ Degrees of enumerations of countable Wehner-like families ⋮ Degree spectra of structures ⋮ Degree spectra and immunity properties

This page was built for publication: Almost computably enumerable families of sets