Countable chains and infinite joins in effectively closed sets of Cantor space
Ahmet \c{C}evik

TL;DR
This paper explores the structure of effectively closed sets in Cantor space, demonstrating the existence of countable chains and infinite joins with specific computability properties, advancing understanding in computability theory.
Contribution
It establishes the existence of countable chains and infinite joins in effectively closed sets with particular non-computability characteristics, generalizing cone avoidance results.
Findings
Existence of a countable infinite sequence of special $\
Construction of a $\
Abstract
We prove that there exists a countable infinite sequence of non-empty special classes such that no infinite union of elements of any computes the halting set. We then give a generalized form of lower and upper cone avoidance for infinite unions. That is, we show that for any special class and any countable sequence of sets in , has a member that is not computable by the infinite union of elements of the sequence. We also prove the upper cone counterpart, that for any non-recursive set , every non-empty class contains a countable sequence of members whose join does not compute . We finally show that there exists a class whose degree specrum is a countably infinite strict chain.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Advanced Algebra and Logic
