English
Related papers

Related papers: An Algebraic Weak Factorisation System on 01-Subst…

200 papers

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Logic · Mathematics 2019-07-12 Marta Bílková , Almudena Colacito

The Weak Gravity Conjecture states that in any consistent theory of quantum gravity in the landscape of string theory, the repulsive force mediated by a U(1) gauge field must be stronger than the attractive force of gravity. In this work,…

High Energy Physics - Theory · Physics 2025-03-13 Tommaso Antonelli , Xavier Calmet

Staton has shown that there is an equivalence between the category of presheaves on (the opposite of) finite sets and partial bijections and the category of nominal restriction sets: see [2, Exercise 9.7]. The aim here is to see that this…

Logic in Computer Science · Computer Science 2014-01-31 Andrew M. Pitts

We consider the variety of $(p+1)$-tuples of matrices $A_j$ (resp. $M_j$) from given conjugacy classes $c_j\subset gl(n,{\bf C})$ (resp. $C_j\subset GL(n,{\bf C})$) such that $A_1+... +A_{p+1}=0$ (resp. $M_1... M_{p+1}=I$). This variety is…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Petrov Kostov

The main goal of the present paper is two-fold. First we extend the theory of toroidal embeddings introduced by Kempf, Knudsen, Mumford and Saint-Donat to the class of toroidal varieties with stratifications (which is the main body of the…

Algebraic Geometry · Mathematics 2016-09-07 Jaroslaw Wlodarczyk

We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…

Category Theory · Mathematics 2007-05-23 Florian Lengyel

The Kadison-Singer Problem (K-S) has expanded since 1959 to a very large number of equivalent problems in various fields. In the present paper we will introduce the notion of weak paveability for positive elements of a von Neumann algebra…

Operator Algebras · Mathematics 2012-03-14 Charles A. Akemann , Joel Anderson , Betul Tanbay

Classification questions are often about understanding components of a category. It is much more desirable however to be able to understand the entire homotopy type of this category and not just the set of its components. In this paper we…

Algebraic Topology · Mathematics 2012-06-21 Martin Blomgren , Wojciech Chacholski

BD-N is a weak principle of constructive analysis. Several interesting principles implied by BD-N have already been identified, namely the closure of the anti-Specker spaces under product, the Riemann Permutation Theorem, and the Cauchyness…

Logic · Mathematics 2015-10-09 Robert S. Lubarsky , Hannes Diener

An algebraic left Kan extension is a left Kan extension which interacts well with the algebraic structure present in the given situation, and these appear in various subjects such as the homotopy theory of operads and in the study of…

Category Theory · Mathematics 2015-11-30 Mark Weber

We prove that certain triangulated categories are (weakly) approximable in the sense of A. Neeman. We prove that a triangulated $C$ that is compactly generated by a single object $G$ is weakly approximable if $C(G,G[i])=0$ for $i>1$ (we say…

K-Theory and Homology · Mathematics 2019-07-23 Mikhail V. Bondarko , Sergei V. Vostokov

We construct a model structure on the category of small categories enriched over a combinatorial closed symmetric monoidal model category satisfying the monoid axiom. Weak equivalences are Dwyer-Kan equivalences, i.e. enriched functors…

Algebraic Topology · Mathematics 2024-08-06 Fernando Muro

Motivated by q-shuffle products determined by Singer from q-analogues of multiple zeta values, we build in this article a generalisation of the shuffle and stuffle products in terms of weak shuffle and stuffle products. Then, we…

Combinatorics · Mathematics 2021-05-05 Cécile Mammez

Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…

Logic in Computer Science · Computer Science 2022-09-27 Christoph Wernhard

Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…

Functional Analysis · Mathematics 2007-05-23 Antoine Delcroix , Maximilian F. Hasler , Stevan Pilipović , Vincent Valmorin

We prove the polynomiality of the bigraded ring $J_{*,*}^{w, W}(F_4)$ of weak Jacobi forms for the root system $F_4$ which are invariant with respect to the corresponding Weyl group. This work is a continuation of the joint article with…

Algebraic Geometry · Mathematics 2020-07-15 Dmitrii Adler

We prove that the weak associativity for modules for vertex algebras are equivalent to a residue formula for iterates of vertex operators, obtained using the weak associativity and the lower truncation property of vertex operators, together…

Quantum Algebra · Mathematics 2013-10-23 Yi-Zhi Huang , Jinwei Yang

We identify a strong structural obstruction to Uniform Separation in constructive arithmetic. The mechanism is independent of semantic content; it emerges whenever two distinct evaluator predicates are sustained in parallel and inference…

Logic · Mathematics 2025-12-16 Milan Rosko

This paper provides a comprehensive overview of some of the foundational properties of categories enriched over quantaloids, along with several new results. We demonstrate that the category whose objects are quantaloid-enriched categories…

Category Theory · Mathematics 2025-10-14 Javier Gutiérrez García , Ulrich Höhle

A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…

Logic in Computer Science · Computer Science 2008-05-19 Russell O'Connor