Related papers: Low$_2$ computably enumerable sets have hyperhyper…

It is shown that every Jiang-Su stable approximately subhomogeneous C*-algebra has finite decomposition rank. Previously, it was not even known that such algebras have finite nuclear dimension. A key step in the proof is that subhomogeneous…

Let $G$ be an acylindrically hyperbolic group. We prove that if $G$ has no non-trivial finite normal subgroups, then the set of invertible elements is dense in the reduced $C^\ast$-algebra of $G$. The same result is obtained for finite…

In this paper, we give two properties of C*-algebra that could be deduced from the properties of its large subalgebra. Let A be an infinite dimensional simple unital C*-algebra and let B be a centrally large subalgebra of A, we prove that A…

We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.

We prove that the zeroth L^2-Betti number of a compact quantum group vanishes unless the underlying C*-algebra is finite dimensional and that the zeroth L^2-homology itself is non-trivial exactly when the quantum group is coamenable.

A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…

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…

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…

A C*-algebra is n-homogeneous (where n is finite) if every its nonzero irreducible representation acts on an n-dimensional Hilbert space. An elementary proof of Fell's characterization of n-homogeneous C*-algebras (by means of their…

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…

A classification of the semisimple subalgebras of the Lie algebra of traceless $3\times 3$ matrices with complex entries, denoted $A_2$, is well-known. We classify its nonsemisimple subalgebras, thus completing the classification of the…

A way to construct (conjecturally all) simple finite dimensional modular Lie (super)algebras over algebraically closed fields of characteristic not 2 is offered. In characteristic 2, the method is supposed to give only simple Lie…

Let $M$ be a cancellative and commutative monoid (written additively). The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements (often called atoms in the literature). Weaker versions of…

We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

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 prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…

In this paper we study the lattice of restricted subalgebras of a restricted Lie algebra. In particular, we consider those algebras in which this lattice is dually atomistic, lower or upper semimodular, or in which every restricted…

We present a classification theorem for amenable simple stably projectionless C*-algebras with generalized tracial rank one whose $K_0$ vanish on traces which satisfy the Universal Coefficient Theorem. One of them is denoted by ${\cal Z}_0$…