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

Let $G$ be the group of points of a split reductive group over a finite extension of ${\mathbb Q}_p$. In this paper, we compute the dimensions of certain classes of locally analytic $G$-representations. This includes principal series…

We describe and characterize the contractively decomposable projections on noncommutative $\mathrm{L}^p$-spaces. Our result relies on a new lifting result for decomposable maps of independent interest and on some tools from ergodic theory.…

We initiate the study of the effective content of $K$-theory for $\mathrm{C}^*$-algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a $\mathrm{C}^*$-algebra $\boldA$, computably…

For each positive integer k, we describe a map f from the complex plane to a suitable non-complete complex locally convex space such that f is k times continuously complex differentiable but not k+1 times, and hence not complex analytic. We…

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

We study the representation theory of finite-dimensional $\omega$-Lie algebras over the complex field. We derive an $\omega$-Lie version of the classical Lie's theorem, i.e., any finite-dimensional irreducible module of a soluble…

Although algorithmic randomness with respect to various non-uniform computable measures is well-studied, little attention has been paid to algorithmic randomness with respect to computable \emph{trivial} measures, where a measure $\mu$ on…

We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures…

We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…

We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…

We give an example of a simple separable C*-algebra which is not isomorphic to its opposite algebra. Our example is nonnuclear and stably finite, has real rank zero and stable rank one, and has a unique tracial state. It has trivial K_1,…

In this article, we prove that a compact open set in the field $\mathbb{Q}_p$ of $p$-adic numbers is a spectral set if and only if it tiles $\mathbb{Q}_p$ by translation, and also if and only if it is $p$-homogeneous which is easy to check.…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

We study the subsymmetric basic sequence structure of variable exponent Lebesgue spaces $L_{P}$ built from index functions $P\colon\Omega\to(0,\infty]$ on $\sigma$-finite measure spaces $(\Omega,\Sigma,\mu)$. Specifically, we prove that if…

By nature, transmissible human knowledge is enumerable: every sentence, movie, audio record can be encoded in a sufficiently long string of 0's and 1's. The works of G\"odel, Turing and others showed that there are inherent limits and…

We construct uncountably many mutually nonisomorphic simple separable stably finite unital exact C$^\ast$-algebras which are not isomorphic to their opposite algebras. In particular, we prove that there are uncountably many possibilities…

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…

We show that for any separably closed field $k$ of characteristic $p>0$, the canonical functor from nilpotent $p$-adic spaces to $\mathbb{E}_{\infty}$-coalgebras over $k$ (given by singular chains with coefficients in $k$) is fully…

Let $G$ be a semisimple Lie group. We describe the irreducible representations of $G$ by linear isometries on $L_p$-spaces for $p\in (1,+\infty)$ with $p\neq 2.$ More precisely, we show that, for every such representation $\pi,$ there…