Related papers: The Universal Exponentiable Arrow
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…
Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…
Each irreducible representation of the affine group of a finite field has a unique maximal inductive algebra, and it is self adjoint.
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
For finitary regular monads T on locally finitely presentable categories we characterize the finitely presentable objects in the category of T-algebras in the style known from general algebra: they are precisely the algebras presentable by…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
Exponentiable functors between quantaloid-enriched categories are characterized in elementary terms. The proof goes as follows: the elementary conditions on a given functor translate into existence statements for certain adjoints that obey…
We classify the finite dimensional irreducible representations of rectangular finite $W$-algebras, i.e., the finite $W$-algebras $U(\mathfrak{g}, e)$ where $\mathfrak{g}$ is a symplectic or orthogonal Lie algebra and $e \in \mathfrak{g}$ is…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
We extend the recently introduced setting of coherent differentiation for taking into account not only differentiation, but also Taylor expansion in categories which are not necessarily (left)additive. The main idea consists in extending…
We consider limits over categories of extensions and show how certain well-known functors on the category of groups turn out as such limits. We also discuss higher (or derived) limits over categories of extensions.
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…
Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…