Free-algebra functors from a coalgebraic perspective

Given a set $\Sigma$ of equations, the free-algebra functor $F_{\Sigma}$ associates to each set $X$ of variables the free algebra $F_{\Sigma}(X)$ over $X$. Extending the notion of \emph{derivative} $\Sigma'$ for an arbitrary set $\Sigma$ of equations, originally defined by Dent, Kearnes, and Szendrei, we show that $F_\Sigma$ preserves preimages if and only if $\Sigma \vdash \Sigma'$, i.e. $\Sigma$ derives its derivative $\Sigma'$. If $F_\Sigma$ weakly preserves kernel pairs, then every equation $p(x,x,y)=q(x,y,y)$ gives rise to a term $s(x,y,z,u)$ such that $p(x,y,z)=s(x,y,z,z)$ and $q(x,y,z)=s(x,x,y,z)$. In this case n-permutable varieties must already be permutable, i.e. Mal'cev. Conversely, if $\Sigma$ defines a Mal'cev variety, then $F_\Sigma$ weakly preserves kernel pairs. As a tool, we prove that arbitrary $Set-$endofunctors $F$ weakly preserve kernel pairs if and only if they weakly preserve pullbacks of epis

Completeness and Universality of Arithmetical Numberings

Abstract We investigate completeness and universality notions, relative to differ-ent oracles, and the interconnection between these notions, with applica-tions to arithmetical numberings. We prove that principal numberings are complete; completeness is independent of the oracle; the degree of any incomplete numbering is meet-reducible, uniformly complete num-berings exist. We completely characterize which finite arithmetical fam-ilies have a universal numbering

A survey on universal computably enumerable equivalence relations

We review the literature on universal computably enumerable equivalence relations, i.e. the computably enumerable equivalence relations (ceers) which are $\Sigma^0_1$-complete with respect to computable reducibility on equivalence relations. Special attention will be given to the so-called uniformly effectively inseparable (u.e.i.) ceers, i.e. the nontrivial ceers yielding partitions of the natural numbers in which each pair of distinct equivalence classes is effectively inseparable (uniformly in their representatives). The u.e.i. ceers comprise infinitely many isomorphism types. The relation of provable equivalence in Peano Arithmetic plays an important role in the study and classification of the u.e.i. ceers