相关论文: Ind- and Pro- definable sets

In various models of set theory, we consider covering Aleph_1 x Aleph_1 rectangles by countably many smooth curves, and we study differentiable isomorphisms between Aleph_1-dense sets of reals.

Soft set theory can deal uncertainties in nature by parametrization process. In this paper, we explore the objects and morphisms of category of soft sets, Sset(U) in detail. Also, gives characterizations of monomorphisms and epimorphisms in…

The concepts of fuzzy objects and their classes are described that make it possible to structurally represent knowledge about fuzzy and partially-defined objects and their classes. Operations over such objects and classes are also proposed…

We classify the localizing tensor ideals of the derived categories of mixed Tate motives over certain algebraically closed fields. More precisely, we prove that these categories are stratified in the sense of Barthel, Heard and Sanders. A…

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

If ${\cal D}$ is a definable category then it may contain no nonzero finitely presented modules but, by a result of Makkai, there is a $\varinjlim$-generating set of strictly ${\cal D}$-atomic modules. These modules share some key…

Free independence is an important tool for studying the structure of operator algebras. It is natural to ask from the model-theoretic standpoint whether free independence is captured well in first-order model theory via the notion of a…

We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then…

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

We give parameterizations of the irreducible representations of finite groups of Lie type in their defining characteristic.

We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

We consider sentence-definable and diagram-definable subfamilies of given families of theories, calculi for these subfamilies, as well dynamics and characteristics of these subfamilies with respect to rank and degree.

A $\mathcal{C}$-set is a functor from the category $\mathcal{C}$ to the category of finite sets and functions. The category of $\mathcal{C}$-sets, $\mathcal{C} - \operatorname*{set}$, is defined as the category whose objects are…

We introduce the concept of indexed identity, where the usual notion of identity is a particular case. Our mathematical framework allows us a generalized method for `indexing' predicates, which corresponds to `fuzzification' of properties,…

We define the class of multivariate group entropies as a novel set of information - theoretical measures, which extends significantly the family of group entropies. We propose new examples related to the "super-exponential" universality…

In these self-contained low prerequisite introductory notes we first present (in part 1) basic concepts of set theory and algebra without explicit category theory. We then present (in part 2) basic category theory involving a somewhat…

This article discuss a class of tractable model in the form of polynomial type.

Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order…

For a relational Horn theory $\mathbb{T}$, we provide useful sufficient conditions for the exponentiability of objects and morphisms in the category $\mathbb{T}\text{-}\mathsf{Mod}$ of $\mathbb{T}$-models; well-known examples of such…