相关论文: Computable Scott Sentences for Quasi-Hopfian Finit…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

In this paper, we show that Cremona groups are sofic. We actually introduce a quantitative notion of soficity, called sofic profile, and show that the group of birational transformations of a d-dimensional variety has sofic profile at most…

We describe a Hopf ring structure on the direct sum of the cohomology groups $\bigoplus_{n \geq 0} H^* \left( W_{B_n}; \mathbb{F}_2 \right)$ of the Coxeter groups of type $B_n$, and an almost-Hopf ring structure on the direct sum of the…

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…

This is part I of a study on cardinals that are characterizable by Scott sentences. Building on [3], [6] and [1] we study which cardinals are characterizable by a Scott sentence $\phi$, in the sense that $\phi$ characterizes $\kappa$, if…

We obtain some new results on the topology of unary definable sets in densely ordered Abelian groups of burden groups of burden 2. In the special case in which the structure has dp-rank 2, we show that the existence of an infinite definable…

The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, $\mathcal{E}$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries:…

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove that for any given system of equations \Sigma, all the solutions of \Sigma over a random group of density d<\frac{1}{2} are…

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, $\E$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries: the…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Let $\mathbb{k}$ be an algebraically closed field of characteristic zero. Let $D$ be a division algebra of degree $d$ over its center $Z(D)$. Assume that $\mathbb{k}\subset Z(D)$. We show that a finite group $G$ faithfully grades $D$ if and…

We study the recursion-theoretic complexity of Positive Almost-Sure Termination ($\mathsf{PAST}$) in an imperative programming language with rational variables, bounded nondeterministic choice, and discrete probabilistic choice. A program…

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

We give a notion of Scott rank for separable metric structures based on the definability of the (metric closures of) automorphism orbits in continuous infinitary logic. This is a continuous analogue of work of Montalb\'an for countable…

We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…