Related papers: Cores of Countably Categorical Structures

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

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…

Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective…

If $R$ is a topological ring then $R^{\ast}$, the group of units of $R$, with the subspace topology is not necessarily a topological group. This leads us to the following natural definition: By an \emph{absolute topological ring} we mean a…

We establish the hierarchy among twelve equivalence relations (similarities) on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relation, four similarities of structures induced by similarities…

We characterize the corings whose category of comodules has a generating set of small projective comodules in terms of the (non commutative) descent theory. In order to extricate the structure of these corings, we give a generalization of…

We define topologically semiperfect (complete, separated, right linear) topological rings and characterize them by equivalent conditions. We show that the endomorphism ring of a module, endowed with the finite topology, is topologically…

We call a finitely complete category algebraically coherent when the change-of-base functors of its fibration of points are coherent, which means that they preserve finite limits and jointly strongly epimorphic pairs of arrows. We give…

We prove that the epimorphism relation is a complete analytic quasi-order on the space of countable groups. In the process, we obtain the result of independent interest that the epimorphism relation on pointed reflexive graphs is complete.

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…

Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…

In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

We prove that $i)$ if $\mathcal{A}$ is $\lambda $-accessible and it is axiomatizable in (finitary) coherent logic then $\lambda $-pure maps are strict monomorphisms and $ii)$ if there is a proper class of strongly compact cardinals and…

Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…

We look at the question of which distance-regular graphs are core-complete, meaning they are isomorphic to their own core or have a complete core. We build on Roberson's homomorphism matrix approach by which method he proved the…

The aim of this paper is to generalize the Core Inverse to arbitrary vector spaces using finite potent endomorphisms. As an application, the core partial order is studied in the set of finite potent endomorphisms (of index lesser or equal…

A graph is $\textit{cubelike}$ if it is a Cayley graph for some elementary abelian $2$-group $\mathbb{Z}_2^n$. The core of a graph is its smallest subgraph to which it admits a homomorphism. More than ten years ago, Ne\v{s}et\v{r}il and…

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

Adhesive categories are categories which have pushouts with one leg a monomorphism, all pullbacks, and certain exactness conditions relating these pushouts and pullbacks. We give a new proof of the fact that every topos is adhesive. We also…