English
Related papers

Related papers: Extending to a model structure is not a first-orde…

200 papers

We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all…

Data Structures and Algorithms · Computer Science 2007-05-23 Markus Frick , Martin Grohe

We introduce some classes of genuine higher categories in homotopy type theory, defined as well-behaved subcategories of the category of types. We give several examples, and some techniques for showing other things are not examples. While…

Category Theory · Mathematics 2013-11-11 James Cranch

We present a family of model structures on the category of multicomplexes. There is a cofibrantly generated model structure in which the weak equivalences are the morphisms inducing an isomorphism at a fixed stage of an associated spectral…

Algebraic Topology · Mathematics 2021-01-13 Xin Fu , Ai Guan , Muriel Livernet , Sarah Whitehouse

By a theorem of Christensen and Hovey, the category of non-negatively graded chain complexes has a model structure, called the h-model structure or Hurewicz model structure, where the weak equivalences are the chain homotopy equivalences.…

Algebraic Topology · Mathematics 2023-07-27 Arnaud Ngopnang Ngompé

We attach to each weak model category $\mathcal{M}$ a class of first order formulas about the fibrant objects of $\mathcal{M}$ whose validity is invariant under homotopies and weak equivalences. This is a generalization of the classical…

Category Theory · Mathematics 2025-10-06 César Bardomiano Martínez , Simon Henry

This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…

General Mathematics · Mathematics 2025-10-23 Joaquim Reizi Barreto

We study 2-monads and their algebras using a Cat-enriched version of Quillen model categories, emphasizing the parallels between the homotopical and 2-categorical points of view. Every 2-category with finite limits and colimits has a…

Category Theory · Mathematics 2010-09-10 Stephen Lack

Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…

Algebraic Topology · Mathematics 2015-05-26 Gabriel C. Drummond-Cole , Joseph Hirsh

In this article, we study model structures on the category of finite graphs with $\times$-homotopy equivalences as the weak equivalences. We show that there does not exist an analogue of Str\o{}m-Hurewicz model structure on this category of…

Algebraic Topology · Mathematics 2022-04-29 Shuchita Goyal , Rekha Santhanam

It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…

Logic · Mathematics 2013-10-18 Denis I. Saveliev

We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…

Category Theory · Mathematics 2014-07-15 André Joyal , Joachim Kock

By careful analysis of the comparison map from a simplicial set to its image under Kan's ex-infinity functor we obtain a new and combinatorial proof that it is a weak homotopy equivalence. Moreover, we obtain a presentation of it as a…

Category Theory · Mathematics 2020-02-14 Sean Moss

We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…

Logic in Computer Science · Computer Science 2008-03-20 Tobias Ganzow , Sasha Rubin

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

Logic · Mathematics 2023-02-17 Saharon Shelah , Alexander Usvyatsov

Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.

Category Theory · Mathematics 2022-02-08 Jiří Rosický

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

Logic · Mathematics 2013-04-15 Vera Koponen

We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and…

Logic · Mathematics 2023-06-22 Siddharth Bhaskar , Alex Kruckman

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

Rings and Algebras · Mathematics 2016-01-12 Eva Bayer-Fluckiger , Uriya A. First

We embed the category of complex manifolds into the simplicial category of prestacks on the simplicial site of Stein manifolds, a prestack being a contravariant simplicial functor from the site to the category of simplicial sets. The…

Complex Variables · Mathematics 2007-05-23 Finnur Larusson

In this work, we introduce the notion of decisional width of a finite relational structure and the notion of decisional width of a regular class of finite structures. Our main result states that given a first-order formula {\psi} over a…

Logic in Computer Science · Computer Science 2021-04-22 Alexsander Andrade de Melo , Mateus de Oliveira Oliveira
‹ Prev 1 3 4 5 6 7 10 Next ›