Related papers: Analytic computable structure theory and $L^p$ spa…

Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^p$ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we determine the…

Suppose $p$ is a computable real so that $p \geq 1$. We show that in both the real and complex case $l^p$ is computably categorical if and only if $p \neq 2$.

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

\begin{abstract} Suppose $p$ is a computable real so that $p \geq 1$. It is shown that the halting set can compute a surjective linear isometry between any two computable copies of $\ell^p$. It is also shown that this result is optimal in…

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…

A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…

Let $\msp$ be a purely non-atomic measure space, and let $1 < p < \infty$. If $\weakLp\msp$ is isomorphic, as a Banach space, to $\weakLp\mspp$ for some purely atomic measure space $\mspp$, then there is a measurable partition $\Omega =…

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

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…

Let $(\Omega,\Sigma,\mu)$ be a measure space and $1< p < +\infty$. In this paper we show that, under quite general conditions, the set $L_{p}(\Omega) - \bigcup\limits_{1 \leq q < p}L_{q}(\Omega)$ is maximal spaceable, that is, it contains…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

Let $\mathcal{M}(\Omega, \mu)$ denote the algebra of all scalar-valued measurable functions on a measure space $(\Omega, \mu)$. Let $B \subset \mathcal{M}(\Omega, \mu)$ be a set of finitely supported measurable functions such that the…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…