相关论文: Relatively computably enumerable reals

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

We associate reduced and full C*-algebras to arbitrary rings and study the inner structure of these ring C*-algebras. As a result, we obtain conditions for them to be purely infinite and simple. We also discuss several examples.…

In this paper we generalize cellular algebras by allowing different partial orderings relative to fixed idempotents. For these relative cellular algebras we classify and construct simple modules, and we obtain other characterizations in…

Let \psi(x) be a polynomial with rational coefficients. Suppose that \psi has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x,y\in A and a…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

We define a notion of relative soficity for countable groups with respect to a family of groups. A group is sofic if and only if it is relative sofic with respect to the family consisting only of the trivial group. If a group is relatively…

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.

Let $A$ be a (not necessarily unital) separable non-elementary simple amenable C*-algebra whose tracial basis may not have finite covering dimension and may not be compact but satisfies certain condition (C). We show that $A$ is ${\cal…

In this short note we confirm the relation between the generalized $abc$-conjecture and the $p$-rationality of number fields. Namely, we prove that given K$/\mathbb{Q}$ a real quadratic extension or an imaginary $S_3$-extension, if the…

We prove the following instance of a conjecture stated in arXiv:1103.4770. Let $G$ be an abelian semialgebraic group over a real closed field $R$ and let $X$ be a semialgebraic subset of $G$. Then the group generated by $X$ contains a…

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

We give an example of a measurable set of reals E such that the set E'={(x,y): x+y in E} is not in the sigma-algebra generated by the rectangles with measurable sides. We also prove a stronger result that there exists an analytic set E such…

We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $\kappa$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both…

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

We study general nilpotent algebras. The results obtained are new even for the classical algebras, such as associative or Lie algebras. We single out certain generic properties of finite-dimensional algebras, mostly over infinite fields.…

A ring $R$ is feckly clean provided that for any $a\in R$ there exists an element $e\in R$ and a full element $u\in R$ such that $a=e+u, eR(1-e)\subseteq J(R)$. We prove that a ring $R$ is feckly clean if and only if for any $a\in R$, there…

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Let $X$ be a topological vector space of complex-valued sequences and $Y$ be a subset of $X$. We provide conditions for $X \setminus Y \cup \{0\}$ to contain uncountably infinitely many linearly independent dense vector subspaces of $X$. We…

Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu.…

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…