Search arXiv⌕ Search

arXiv · 1807.07261

Countable chains and infinite joins in effectively closed sets of Cantor space

Abstract

We prove that there exists a countable infinite sequence of non-empty special $Π^0_1$ classes $\{\mathcal{P}_i\}_{i\inω}$ such that no infinite union of elements of any $\mathcal{P}_i$ 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 $Π^0_1$ class $\mathcal{P}$ and any countable sequence of sets in $\mathcal{P}$, $\mathcal{P}$ 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 $X$, every non-empty $Π^0_1$ class contains a countable sequence of members whose join does not compute $X$. We finally show that there exists a $Π^0_1$ class whose degree specrum is a countably infinite strict chain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmet Çevik. 2018-07-19. Countable chains and infinite joins in effectively closed sets of Cantor space. https://arxiv.org/abs/1807.07261

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Proof Theory for Profinite Modal Algebras

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be presented as Lindenbaum algebras for propositional theories in infinitary versions of propositional modal calculi. In this paper we identify such calculi as modal enrichments of Maehara-Takeuti's infinitary extension of the sequent calculus $\mathbf{LK}$. We also investigate correspondences between syntactic properties of the calculi and regularity/exactness properties of the opposite category of profinite $L$-algebras.

math.LO↗

The Q-Calculus: A Quaternion-Based Laws of Form System

This paper introduces a Laws of Form version of the Quaternions. We call this the Q-Calculus, a 16-valued extension of Laws of Form (LoF) which is closely related to the BF Calculus (where we have a single square root of the mark) and the concept of the square root of negation (related to the the square root of minus one). We construct Q as a system of LoF mark operators acting on 4-tuples, and prove that the set of eight operators in Q is isomorphic to the quaternion group, which is non-commutative. We give a novel proof of several of Q's distribution laws using non-commutative logic gates. We indicate how to represent Q as braids by associating elementary braids to square roots of negation. This results in a very concise representation of Q as LoF braids. We end the paper with an indication of how we can represent the Artin braid group in LoF and how we can generalize our work with the quaternions to Clifford algebras.

math.LO↗

Pointwise provable equality and the failure of composition

In their studies of pathologies in recursion categories, Montagna (1989) and Di Paola--Montagna (1991) introduce the algebraic systems $S'$ and $S'_T$, respectively, and claim that they are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two unary programs whose partial functions are provably equal in $T$, separately at each standard input. Composing each after a program that searches for a $T$-proof of contradiction and returns its code yields programs that are not equivalent in this sense. An alternative proof uses the productivity of the complement of the diagonal halting set. Montagna's $S'$ is the case $T=\mathrm{PA}$. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗