English
Related papers

Related papers: Ind- and Pro- definable sets

200 papers

The paper aims to establish a convenient formal framework for investigating the phenomenon of scheme definiteness, exemplified by first-order internal categoricity as studied by V\"a\"an\"anen, among others. To this end, we introduce the…

Logic · Mathematics 2025-12-01 Piotr Gruza , Mateusz Łełyk

In this paper, we propose a first-order ontology for generalized stratified order structure. We then classify the models of the theory using model-theoretic techniques. An ontology mapping from this ontology to the core theory of Process…

Artificial Intelligence · Computer Science 2009-07-17 Dai Tri Man Le

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov

The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…

Category Theory · Mathematics 2007-05-23 John W. Barrett , Marco Mackaay

We introduce the notion of saturated sets of primes of an algebraic number field and prove an analogue of Riemann's existence theorem for the decomposition groups of infinite stably saturated sets of primes.

Number Theory · Mathematics 2015-12-08 Kay Wingberg

We consider a declarative framework for machine learning where concepts and hypotheses are defined by formulas of a logic over some background structure. We show that within this framework, concepts defined by first-order formulas over a…

Machine Learning · Computer Science 2017-01-20 Martin Grohe , Martin Ritzert

For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.

We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like senders and…

Computational Complexity · Computer Science 2012-09-06 Nerio Borges

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

Logic in Computer Science · Computer Science 2015-07-01 Benoit Larose , Cynthia Loten , Claude Tardif

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

We explain how categories, and groupoids, can be seen as models for a Lawvere ${\mathfrak Gr}$-theory, where ${\mathfrak Gr}$ is the category of graphs, and show that for Lawvere ${\mathfrak Gr}$-theories finitely presentable models are…

Category Theory · Mathematics 2011-09-12 Kuerak Chung , Giovanni Marelli

We describe conditions that characterize amenability for groups in terms of positive definite functions valued in a von Neumann algebra.

Operator Algebras · Mathematics 2022-02-02 Mikaël Pichot , Erik Séguin

We begin the study of categorical logic for continuous model theory. In particular, we 1. introduce the notions of metric logical categories and functors as categorical equivalents of a metric theory and interpretations, 2. prove a…

Logic · Mathematics 2016-07-12 Jean-Martin Albert , Bradd Hart

For an arbitrary category, we consider the least class of functors con- taining the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of…

Logic in Computer Science · Computer Science 2016-10-21 Luigi Santocanale

In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…

Category Theory · Mathematics 2023-06-22 Valery Isaev

The present article is devoted to some examples of functions whose arguments represented in terms of certain series of the Cantor type.

Classical Analysis and ODEs · Mathematics 2021-01-05 Symon Serbenyuk

We offer streamlined proofs of fundamental theorems regarding the index theory for partial self-maps of an infinite set that are bijective between cofinite subsets.

Combinatorics · Mathematics 2015-10-09 P. L. Robinson

In this note we show that groups with definable generics in a separably closed valued of finite imperfection degree can be embedded into groups definable in their algebraic closure.

Logic · Mathematics 2017-11-07 Silvain Rideau

We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give…

Logic · Mathematics 2021-04-19 Itay Kaplan , Nicholas Ramsey , Saharon Shelah

We give a model-independent definition of limits for diagrams valued in an $(\infty,n)$-category. We show that this definition is compatible with the existing notion of homotopy 2-limits for 2-categories, with the existing notion of…

Algebraic Topology · Mathematics 2026-03-31 Lyne Moser , Nima Rasekh , Martina Rovelli