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

We associate canonical virtual motives to definable sets over a field of characteristic zero. We use this construction to show that very general p-adic integrals are canonically interpolated by motivic ones.

This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…

We study properties of relative modular categories and derive sufficient conditions for their existence. In particular, we derive sufficient conditions for relative pre-modular categories to be non-degenerate and relative modular, and for…

We completely describe the finitely generated pro-$p$ subgroups of the profinite completion of the fundamental group of an arbitrary $3$-manifold. We also prove a pro-$p$ analogue of the main theorem of Bass--Serre theory for finitely…

We discuss that there exist at least two different choices in the signs of the induced A-infinity structures in shifting the degree of objects in an A-infinity category. We show that both of these choices are naturalin the sense that they…

This is a largely expository paper about how groups arise or are of interest in model theory. Included are the following topics: classifying groups definable in specific structures or theories and the relation to algebraic groups, groups…

The purpose of this book is to lay out certain aspects of descriptive set theory. After initially establishing notation and generalities we proceed to the following topics: partitions, semirings, rings, $\sigma$-rings, $\delta$-rings,…

We consider limits over categories of extensions and show how certain well-known functors on the category of groups turn out as such limits. We also discuss higher (or derived) limits over categories of extensions.

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

We define the notion of duality categories as generalization of duality groups. Two examples are treated. The first is the Serre duality in the categories of strict polynomial functors. The second concerns finite complexes. We show in…

Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an…

The text is based on notes from a class entitled {\em Model Theory of Berkovich Spaces}, given at the Hebrew University in the fall term of 2009, and retains the flavor of class notes. It includes an exposition of material from…

We define a variety of notions of cubical sets, based on sites organized using substructural algebraic theories presenting PRO(P)s or Lawvere theories. We prove that all our sites are test categories in the sense of Grothendieck, meaning…

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

In this article we consider alternative definitions-descriptions of a set being Infinite within the primitive Axiomatic System of Zermelo.

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…

We give an explicit construction of the category Opetope of opetopes. We prove that the category of opetopic sets is equivalent to the category of presheaves over Opetope.

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…

We study reductions well suited to compare structures and classes of structures with respect to properties based on enumeration reducibility. We introduce the notion of a positive enumerable functor and study the relationship with…