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

The concept of n-categories and related subject is considered. An n-category is described as an n-graph with a composition. A new definition of operad is presented. Some illustrative examples are given.

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

We present here definitions and constructions basic for the theory of monoidal and tensor categories. We provide references to the original sources, whenever possible. Group-theoretical categories are used as examples

We introduce the notion of an ordered face structure. The ordered face structures to many-to-one computads are like positive face structures to positive-to-one computads. This allow us to give an explicit combinatorial description of…

We consider notions of metrized categories, and then approximate categorical structures defined by a function of three variables generalizing the notion of $2$-metric space. We prove an embedding theorem giving sufficient conditions for an…

We consider d-minimal expansions of ordered fields. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several technical conditions are satisfied. These conditions are satisfied…

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…

We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…

We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

We give a new elementary proof of the main theorem of [Fef12]: Quantifiers implicitly definable in pure second-order logic equipped with Henkin semantics implies are (explicitly) definable in first-order logic.

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

We study elementary theories of well-pointed toposes and pretoposes, regarded as category-theoretic or "structural" set theories in the spirit of Lawvere's "Elementary Theory of the Category of Sets". We consider weak intuitionistic and…

In this thesis, we develop various techniques for working with sets in machine learning. Each input or output is not an image or a sequence, but a set: an unordered collection of multiple objects, each object described by a feature vector.…

We give some background on uniform pro-p groups and the model theory of profinite NIP groups.

We show that C if is a proper model category, then the pro-category pro-C has a strict model structure in which the weak equivalences are the levelwise weak equivalences. The strict model structure is the starting point for many homotopy…

A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…