On functor-quotients and their isomorphism theorems

Jordan Mitchell Barrett; Valentino Vito

Home/Archive/arXiv

arXiv · 2006.11720

On functor-quotients and their isomorphism theorems

Jordan Mitchell Barrett·Valentino Vito

View original source ↗Read source document ↗Export metadata ↓

Abstract

The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a category $\mathbf{C}$, which are relativized to a faithful functor $\mathcal{F}\colon \mathbf{C} \to \mathbf{D}$. The isomorphism theorems of universal algebras generalize to this setting, and we additionally find important links between $\mathcal{F}$-quotients in the concrete category of first-order structures, and quotients defined for model-theoretic equivalence classes. By first working in this categorical setting, some quotient-related results for first-order structures can be naturally obtained. In particular, we are able to prove some isomorphism theorems in the context of model theory directly from their corresponding categorical isomorphism theorems.

Explore related subjects

math.LO math.CT math.RA

Keep this discovery

BibTeX RIS

Jordan Mitchell Barrett, Valentino Vito. 2020-06-21. On functor-quotients and their isomorphism theorems. https://arxiv.org/abs/2006.11720

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗