English
Related papers

Related papers: Accessible model categories

200 papers

For a connected Lie group G it was shown by Lee, Ludwig, Samei and Spronk that its Fourier algebra A(G) is weakly amenable only if G is abelian. We extend this result to general connected locally compact groups, extending an approach…

Functional Analysis · Mathematics 2023-05-24 Viktor Losert

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

Logic · Mathematics 2019-12-19 Slavko Moconja , Predrag Tanović

We give a criterion for a functor \(F:C\rightarrow B\) between small categories to generate a small presentation of the universal model category \(U(B)\) in the sense of Dugger.

Category Theory · Mathematics 2024-11-26 Seunghun Lee

According to Bell's theorem a large class of hidden-variable models obeying Bell's notion of local causality conflict with the predictions of quantum mechanics. Recently, a Bell-type theorem has been proven using a weaker notion of local…

Quantum Physics · Physics 2012-03-05 Samuel Portmann , Adrian Wuethrich

We show that the category of categories fibred over a site is a generalized Quillen model category in which the weak equivalences are the local equivalences and the fibrant objects are the stacks, as they were defined by J. Giraud. The…

Category Theory · Mathematics 2014-04-17 Alexandru E. Stanculescu

Garside groupoids, as recently introduced by Krammer, generalise Garside groups. A weak Garside group is a group that is equivalent as a category to a Garside groupoid. We show that any periodic loop in a Garside groupoid $\CG$ may be…

Group Theory · Mathematics 2007-05-23 David Bessis

We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…

Logic in Computer Science · Computer Science 2024-02-05 Thibaut Benjamin , Eric Finster , Samuel Mimram

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…

Artificial Intelligence · Computer Science 2022-04-08 Martin Caminada , Sri Harikrishnan

We put a model structure on the category of categories internal to simplicial sets whose weak equivalences are reflected by the nerve functor to bisimplicial sets with Rezk's model structure. This model structure is shown to be Quillen…

Algebraic Topology · Mathematics 2016-10-12 Geoffroy Horel

We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it…

Computational Geometry · Computer Science 2007-05-23 Vin de Silva

Many definitions of weak and strict $\infty$-categories have been proposed. In this paper we present a definition for $\infty$-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type…

Category Theory · Mathematics 2021-09-06 Eric Finster , Alex Rice , Jamie Vicary

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…

Logic in Computer Science · Computer Science 2014-05-28 Jürgen Christ , Jochen Hoenicke

The importance of accessible categories has been widely recognized; they can be described as those freely generated in some precise sense by a small set of objects and, because of that, satisfy many good properties. More specifically…

Category Theory · Mathematics 2022-05-31 Stephen Lack , Giacomo Tendas

We introduce a general method for showing under weak forcing axioms that reduced products of countable models of a theory $T$ have as few automorphisms as possible. We show that such forcing axioms imply that reduced products of countably…

Logic · Mathematics 2024-10-30 Ben De Bondt , Ilijas Farah , Alessandro Vignati

In this paper we study the Martin boundary at infinity for a large class of purely discontinuous Feller processes on metric measure spaces. We show that if $\infty$ is accessible from an open set $D$, then there is only one Martin boundary…

Probability · Mathematics 2016-11-17 P. Kim , R. Song , Z. Vondraček

For any commutative ring $R$, we show that the categories of $R$-coalgebras and cocommutative $R$-coalgebras are locally $\aleph_1$-presentable, while the categories of $R$-flat $R$-coalgebras are $\aleph_1$-accessible. Similarly, for any…

Rings and Algebras · Mathematics 2025-07-25 Leonid Positselski

If a locally cartesian closed category carries a weak factorisation system, then the left maps are stable under pullback along right maps if and only if the right maps are closed under pushforward along right maps. We refer to this…

Category Theory · Mathematics 2024-04-25 Wijnand van Woerkom , Benno van den Berg

We present a new strictification method for type-theoretic structures that are only weakly stable under substitution. Given weakly stable structures over some model of type theory, we construct equivalent strictly stable structures by…

Logic in Computer Science · Computer Science 2022-11-28 Rafaël Bocquet

If all objects of a simplicial combinatorial model category \cat A are cofibrant, then there exists the homotopy model structure on the category of small functors $\sS^{\cat A}$, where the fibrant objects are homotopy functors, i.e.,…

Algebraic Topology · Mathematics 2024-07-24 Boris Chorny , David White

Let G be a countable group. We proof that there is a model companion for the approximate theory of a Hilbert space with a group G of automorphisms. We show that G is amenable if and only if the structure induced by countable copies of the…

Logic · Mathematics 2007-05-23 Alexander Berenstein