On the filter of computably enumerable supersets of an r-maximal set

DOI10.1007/PL00003846zbMath1030.03029OpenAlexW2012723279MaRDI QIDQ5950713

André Nies, D. Reed Solomon, Steffen Lempp

Publication date: 13 December 2001

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (3)

Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets

This page was built for publication: On the filter of computably enumerable supersets of an r-maximal set