Related papers: On true empty category
Questions of set-theoretic size play an essential role in category theory, especially the distinction between sets and proper classes (or small sets and large sets). There are many different ways to formalize this, and which choice is made…
Prof. Boris I. Plotkin [arXiv:math.GM/0210194, arXiv:math.GM/0204245] drew attention to the question when an equivalence between two categories is isomorphic as a functor to an isomorphism between them. It turns out that it is quite…
If M is a model category and Z is an object of M, then there are model category structures on the category of objects of M over Z and the category of objects of M under Z under which a map is a cofibration, fibration, or weak equivalence if…
Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…
Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the…
We provide a new characterization of enriched accessible categories by introducing the two new notions of virtual reflectivity and virtual orthogonality as a generalization of the usual reflectivity and orthogonality conditions for locally…
This note relates axioms for partial semigroups and monoids with those for small object-free categories, either with multiple monoidal units or with source and target maps. We discuss the adjunction of a zero element to both kinds of…
Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with…
We study the problem of ignorability in likelihood-based inference from incomplete categorical data. Two versions of the coarsened at random assumption (car) are distinguished, their compatibility with the parameter distinctness assumption…
Given any separable complex Hilbert space, any trace-class operator $B$ which does not have purely imaginary trace, and any generator $L$ of a norm-continuous one-parameter semigroup of completely positive maps we prove that there exists a…
We show that in the category of preordered sets, there is a natural notion of pretorsion theory, in which the partially ordered sets are the torsion-free objects and the sets endowed with an equivalence relation are the torsion objects.…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…
The purpose of this short and elementary note is to identify some classes of exact categories introduced in L. Previdi's thesis. Among other things we show: (1) An exact category is partially abelian exact if and only if it is abelian. (2)…
We introduce a notion of real rank zero for inclusions of C$^*$-algebras. After showing that our definition has many equivalent characterisations, we offer a complete description of the commutative case. We provide permanence and…
Given an additive equational category with a closed symmetric monoidal structure and a potential dualizing object, we find sufficient conditions that the category of topological objects over that category has a good notion of full…
Locales have been studied as "topologies without points", mainly by tools of category theory. While traditional topology presents a space as a set of points with specified neighborhoods, localic topology presents a space as a lattice of…
We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…
Category theory in homotopy type theory is intricate as categorical laws can only be stated "up to homotopy", and thus require coherences. The established notion of a univalent category (Ahrens, Kapulkin, Shulman) solves this by considering…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…