Related papers: Relatively computably enumerable reals
We characterize finite-dimensional thick representations over ${\Bbb C}$ of connected complex semi-simple Lie groups by irreducible representations which are weight multiplicity-free and whose weight posets are totally ordered sets.…
We show that a separable purely infinite C*-algebra is of real rank zero if and only if its primitive ideal space has a basis consisting of compact-open sets and the natural map K_0(I) -> K_0(I/J) is surjective for all closed two-sided…
A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some…
We demonstrate that pure C*-algebras form a robust class by proving that pureness follows from very weak comparison and divisibility properties. Using this, we show that every simple, non-elementary C*-algebra with a unique quasitrace and…
We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.
This paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…
Let p be a polynomial in one variable. It is shown that the universal C*-algebra of the relation p(x)=0, \|x\| \le C is semiprojective, residually finite-dimensional and has trivial extension group.
A real algebraic variety W of dimension m is said to be uniformly rational if each of its points has a Zariski open neighborhood which is biregularly isomorphic to a Zariski open subset of R^m. Let l be any nonnegative integer. We prove…
Nuclear $C^*$-algebras having a system of completely positive approximations formed with convex combinations of a uniformly bounded number of order zero summands are shown to be approximately finite dimensional.
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…
Given a set X of finite strings, one interesting question to ask is whether there exists a member of X which is simple conditional to all other members of X. Conditional simplicity is measured by low conditional Kolmogorov complexity. We…
Let X be a locally compact space, and let A and B be Co(X)-algebras. We define the notion of an asymptotic Co(X)-morphism from A to B and construct representable E-theory groups RE(X;A,B). These are the universal groups on the category of…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
The simple symplectic triple systems over the real numbers are classified up to isomorphism, and linear models of all of them are provided. Besides the split cases, one for each complex simple Lie algebra, there are two kinds of non-split…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…
By a labeled graph $C^*$-algebra we mean a $C^*$-algebra associated to a labeled space $(E,\mathcal L,\mathcal E)$ consisting of a labeled graph $(E,\mathcal L)$ and the smallest normal accommodating set $\mathcal E$ of vertex subsets.…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
We study computable probably approximately correct (CPAC) learning, where learners are required to be computable functions. It had been previously observed that the Fundamental Theorem of Statistical Learning, which characterizes PAC…
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence relation which partitions the natural numbers into…