Related papers: A computability theoretic equivalent to Vaught's c…

For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…

We prove that every positive trace on a countably generated *-algebra can be approximated by positive traces on algebras of generic matrices. This implies that every countably generated tracial *-algebra can be embedded into a metric…

We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a…

Let $G$ be a connected reductive algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p \ge 0$, and let $\mathcal{N}$ be its nilpotent cone. Under mild hypotheses, we construct for each nilpotent $G$-orbit $C$ and…

When $p$ is a computable real so that $p \geq 1$, the isometry degree of a computable copy $\mathcal{B}$ of $\ell^p$ is defined to be the least powerful Turing degree that computes a linear isometry of $\ell^p$ onto $\mathcal{B}$. We show…

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

We say that a (countably dimensional) topological vector space $X$ is orbital if there is $T\in L(X)$ and a vector $x\in X$ such that $X$ is the linear span of the orbit ${T^nx:n=0,1,...}$. We say that $X$ is strongly orbital if,…

A set $A$ is coarsely computable with density $r \in [0,1]$ if there is an algorithm for deciding membership in $A$ which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least $r$. To any Turing…

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

The Tate conjecture has two parts: an assertion (S) about semisimplicity of Galois representations, and an assertion (T) which says that every Tate class is algebraic. We show that in characteristic 0, (T) implies (S). In characteristic p…

It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that is any kind of promise that x belongs to a certain subset A'…

We show that any countable model of a model complete theory has an elementary extension with a "pseudofinite-like" quasidimension that detects dividing.

We develop the theory of the higher commutator for Taylor varieties. A new higher commutator operation called the hypercommutator is defined using a type of invariant relation called a higher dimensional congruence. The hypercommutator is…

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

We prove that there are infinitely many $n$ such that $\omega(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao-Ter\"{a}v\"{a}inen (2025), who has $O(k)$ in place of $O(\log k)$. As corollaries, we make progress…

Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…