Related papers: Ind- and Pro- definable sets
We classify the module categories over the double (possibly twisted) of a finite group.
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…
We introduce the notion of inductive category in a model category and prove that it agrees with the Ganea approach given by Doeraene. This notion also coincides with the topological one when we consider the category of (well-) pointed…
We give a model-theoretic characterization of the class of geometric theories classified by an atomic topos having enough points; in particular, we show that every complete geometric theory classified by an atomic topos is countably…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…
We consider sets/relations/computations defined by *Elementary Inference Systems* I, which are obtained from Smullyan's *elementary formal systems* using Gentzen's notation for inference rules, and proof trees for atoms P(t_1,...,t_n),…
We prove that the category of models of any relational Horn theory satisfying a mild syntactic condition is infinitely extensive. Central examples of such categories include the categories of preordered sets and partially ordered sets, and…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
Metaphysical interpretations of set theory are either inconsistent or incoherent. The uses of sets in mathematics actually involve three distinct kinds of collections (surveyable, definite, and heuristic), which are governed by three…
This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…
We define a notion of "theory of (1,infty)-categories", and we prove that such a theory is unique up to equivalence.
We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…
A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…
In this article, we present the stable category of preordered groups associated with some Z-pretorsion theory. We first define such a category as well as the related functor, and then study their properties. By doing so, we provide a…
In these talks, I discuss a few selected topics in integrable models that are of interest from various points of view. Some open questions are also described.
In this survey article (which hitherto is an ongoing work-in-progress) we present the formulation of the induction and coinduction principles using the language and conventions of each of order theory, set theory, programming languages'…
We introduce and study the class of spherically ordered groups. The notions of spherically ordered groups and their spectra of spherical orderability are introduced. Values of these spectra are found for a series of natural groups.
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…