Related papers: A note on the degree structure of primitive recurs…
If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for $\SI 1$, the…
We show that the full group C$^*$-algebra of the free product of two nontrivial countable amenable discrete groups, where at least one of them has more than two elements, is primitive. We also show that in many cases, this C$^*$-algebra is…
We show that under Dickson's conjecture about the distribution of primes in the natural numbers, the theory Th(Z,+,1,0,Pr) where Pr is a predicate for the prime numbers and their negations is decidable, unstable and supersimple. This is in…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
We consider $\Lambda$ an artin algebra and $n \geq 2$. We study how to compute the left and right degrees of irreducible morphisms between complexes in a generalized standard Auslander-Reiten component of ${\mathbf{C_n}({\rm proj}\,…
In this paper we study structural properties of LV-degrees of the algebra of collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. We construct atoms…
Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…
We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…
We present a description of non-solvable groups in which all real irreducible character degrees are prime-power numbers.
In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H acting completely reducibly on a vector space V: if the orbits containing the vectors a and b have coprime lengths m and n, we prove that the…
The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…
Let $k$ be a field and let $R$ be a countable dimensional prime von Neumann regular $k$-algebra. We show that $R$ is primitive, answering a special case of a question of Kaplansky.
Here, in every simple finite-dimensional vectorial Lie superalgebra considered with the standard grading where every indeterminate is of degree 1, the maximal graded solvable subalgebras are classified over $\mathbb{C}$.
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…