Related papers: Turing Degrees and Automorphism Groups of Substruc…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…
We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…
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…
This paper addresses several structural aspects of the insertion-elimination algebra, a Lie algebra that can be realized in terms of tree-inserting and tree-eliminating operations on the set of rooted trees. In particular, we determine the…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…
Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…
This paper investigates the interplay between algebraic structure, topology, and differentiability in Clifford semigroups. The study is developed along three main themes. First, in the compact Hausdorff setting, we provide an explicit…
We use finite group topological lattice gauge theory, also known as the quantum double model, as a lens to explore a notion of topological order enriched by a non-invertible symmetry. For invertible symmetry enriched topological order,…
The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…