Related papers: A Computably Enumerable $tt$-Degree Without Comput…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
We prove that for every pair of positive integers a, b there exists a number c_0 such that for every c>=c_0 one can find a tame polynomial automorphism of C^3 with multidegree equal to (a,b,c).
The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…
We derive faithful inclusions of C*-algebras from a coend-type construction in unitary tensor categories. This gives rise to different potential notions of discreteness for an inclusion in the non-irreducible case, and provides a unified…
Let $2<n<m\leq \omega$. Let $\CA_n$ denote the class of cylindric algebras of dimension $n$ and $\RCA_n$ denote the class of representable $\CA_n$s. We say that $\A\in \RCA_n$ is representable up to $m$ if $\Cm\At\A$ has an $m$-square…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
It was recently shown that each C*-algebra generated by a faithful irreducible representation of a finitely generated, torsion free nilpotent group is classified by its ordered K-theory. For the three step nilpotent group $UT(4,\mathbb{Z})$…
Recently, S. Carpi et al. (Comm. Math. Phys., 402:169-212, 2023) proved that every connected (i.e. haploid) Frobenius algebra in a tensor C$^*$-category is unitarizable (i.e. isomorphic to a special C$^*$-Frobenius algebra). Building on…
We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure $\mathcal A$ as the family of Turing degrees that compute…
Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…
A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness…
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…
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…
For an associative algebra $A$ with a simple module $M$ with trivial endomorphisms and trivial annihilator we verify the countable separation property (CSP), i.e. we prove that there exists a list of nonzero elements $a_1, a_2,\ldots$ of…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
A longstanding open problem is whether there exists a non syntactical model of the untyped lambda-calculus whose theory is exactly the least lambda-theory (l-beta). In this paper we investigate the more general question of whether the…