Related papers: Effective categoricity of equivalence Structures

An algebra $\mathcal{A}$ of real or complex valued functions defined on a set $\mathbf{T}$ shall be called \textit{homotonic} if $\mathcal{A}$ is closed under forming of absolute values, and for all $f$ and $g$ in $\mathcal{A}$, the product…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…

Let $\mathscr{L}$ be a recursive language. Let $S(\mathscr{L})$ be the set of $\mathscr{L}$-structures with domain $\omega$. Let $\Phi : {}^\omega 2 \rightarrow S(\mathscr{L})$ be a $\Delta_1^1$ function with the property that for all $x,y…

Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…

In this paper we put a cofibrantly generated model category structure on the category of small simplicial categories. The weak equivalences are a simplicial analogue of the notion of equivalence of categories.

A complete classifications, up to isomorphism, of two-dimensional associative and diassociative algebras over any basic field are given.

We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland,…

We study the structure of the partial order induced by the definability relation on definitions of truth for the language of arithmetic. Formally, a definition of truth is any sentence $\alpha$ which extends a weak arithmetical theory…

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Let $\Omega$ be a compact subset of $\mathbb{C}$ and let $A$ be a unital simple, separable $C^*$-algebra with stable rank one, real rank zero and strict comparison. We show that, given a Cu-morphism $\alpha:{\rm Cu}(C(\Omega))\to {\rm…

We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…

We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…

We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…

We provide a characterization of those relation algebras which are isomorphic to the algebras of compatible relations of some $\Z_2$-set. We further prove that this class is finitely axiomatizable in first-order logic in the language of…

Truth refers to the satisfaction relation used to define the semantics of model-theoretic languages. The satisfaction relation for first order languages (truth classification), and the preservation of truth by first order interpretations…

In this work, we establish a categorification of the classical Dold-Kan correspondence in the form of an equivalence between suitably defined $\infty$-categories of simplicial stable $\infty$-categories and connective chain complexes of…

In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that…