相关论文: Relatively computably enumerable reals

The reduced C*-algebra of a countable linear group G is shown to be simple if and only if G has no nontrivial normal amenable subgroups. Moreover, these conditions are shown to be equivalent to the uniqueness of tracial state on the…

We give a counterexample to a conjecture of S.E. Morris by showing that there is a compact plane set X such that R(X) has no non-zero, bounded point derivations but such that R(X) is not weakly amenable. We also give an example of a…

A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

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…

A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…

Let $X(\RR)$ be a geometrically connected variety defined over $\RR$ and such that the set of all its (also complex) points $X(\CC)$ is non-degenerate. We introduce the notion of \emph{admissible rank} of a point $P$ with respect to $X$ to…

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…

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…

Let G be a finite group. An element x in G is a real element if x is conjugate to its inverse in G. For x in G, the conjugacy class x^G is said to be a real conjugacy class if every element of x^G is real. We show that if 4 divides no real…

In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…

We define a general notion of "summability" of a set $I\subseteq\mathbb{C^{N}}$ and show that some trivial condition necessary for a set to be summable, is also sufficient. We deduce some intresting corollaries.

I give a short proof of the following algebraic statement: if a vertex algebra is simple, then its underlying Lie conformal algebra is either abelian, or it is an irreducible central extension of a simple Lie conformal algebra.

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…

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…

We introduce the notion of weakly (strongly) infinite real rank for unital $C^{\ast}$-algebras. It is shown that a compact space $X$ is weakly (strongly) infine-dimensional if and only if $C(X)$ has weakly (strongly) infinite real rank.…

We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating $\Pi^0_1$ class of c.e.\ degree. We show that for every c.e.\ degree $\mathbf{c}$, the collection $\{\mathbf{c},…

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

We characterize relatively hyperbolic groups whose reduced $C^*$-algebra is simple as those, which have no non-trivial finite normal subgroups.