Effective forcing with Cantor manifolds
classification
🧮 math.LO
math.GN
keywords
forcingenumerationalgorithmcalledcantorcomplementcototaleffective
read the original abstract
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$, enumerates $A$. Many variants of totality and cototality have been studied in computability theory. In this note, by an effective forcing construction with strongly infinite dimensional Cantor manifolds, which can be viewed as an effectivization of Zapletal's "half-Cohen" forcing (i.e., the forcing with Henderson compacta), we construct a set of integers whose enumeration degree is cototal, almost total, but neither cylinder-cototal nor telograph-cototal.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.