相关论文: Turing Incomparability in Scott Sets

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power…

This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a…

The paper puts into discussion the concept of universality, in particular for structures not of the power of Turing computability. The question arises if for such structures a universal structure of the same kind exists or not. For that the…

There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…

One partially ordered set, $Q$, is a Tukey quotient of another, $P$, if there is a map $\phi : P \to Q$ carrying cofinal sets of $P$ to cofinal sets of $Q$. Two partial orders which are mutual Tukey quotients are said to be Tukey…

An r.e. set $A$ is speedable if for every recursive function, there exists a program enumerating membership in $A$ faster, by the desired recursive factor, on infinitely many integers. We construct a speedable set that cannot be split into…

Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu.…

There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…

In this paper, we introduce the notion of $\mathcal{M}$-convergence and $\mathcal{MN}$-convergence structures in posets, which, in some sense, generalise the well-known Scott-convergence and order-convergence structures. As results, we give…

For continuous maps of compact metric spaces $f:X\to X$ and $g:Y\to Y$ and for various notions of topological recurrence, we study the relationship between recurrence for $f$ and $g$ and recurrence for the product map $f\times g:X\times Y…

Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…

Let $G$ be an abelian group, and $F$ a downward directed family of subsets of $G$. The finest topology $\mathcal{T}$ on $G$ under which $F$ converges to $0$ has been described by I.Protasov and E.Zelenyuk. In particular, their description…

It is shown that for any torsion unit of augmentation one in the integral group ring $\mathbb{Z} G$ of a finite solvable group $G$, there is an element of $G$ of the same order.

Let $\pi: Y\rightarrow X$ be a continuous surjection between compact Hausdorff spaces $Y$ and $X$ which is irreducible in the sense that if $F\subsetneq Y$ is closed, then $\pi(F)\neq X$. We exhibit isomorphisms between various Boolean…

We give characterizations for the (in ZFC unprovable) sentences ``Every $\Sb{1}{2}$--set is measurable" and ``Every $\Db{1}{2}$--set is measurable" for various notions of measurability derived from well--known forcing partial orderings.

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

Strongly Turing determinacy, or $\mathrm{sTD}$, says that for any set $A$ of reals, if $\forall x\exists y\geq_T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing determinacy…

It is proven that if a finite group $G$ has a normal subgroup $H$ with $p'$-index (where $p$ is a prime) and $G/H$ is solvable, then for a $p$-subgroup $P$ of $H$, if the Scott $kH$-module with vertex $P$ is Brauer indecomposable, then so…