English
Related papers

Related papers: Infinite Traces by Finality: a Sheaf-Theoretic App…

200 papers

We investigate extensions of S. Solecki's theorem on closing off finite partial isometries of metric spaces \cite{solecki1} and obtain the following exact equivalence: any action of a discrete group $\Gamma$ by isometries of a metric space…

Logic · Mathematics 2011-04-19 Christian Rosendal

We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…

Logic · Mathematics 2026-05-13 Erik Walsberg

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann

We propose trace logic, an instance of many-sorted first-order logic, to automate the partial correctness verification of programs containing loops. Trace logic generalizes semantics of program locations and captures loop semantics by…

Logic in Computer Science · Computer Science 2020-08-07 Pamina Georgiou , Bernhard Gleiss , Laura Kovács

We develop a sheaf cohomology theory of algebraic varieties over an algebraically closed non-trivially valued non-archimedean field $K$ based on Hrushovski-Loeser's stable completion. In parallel, we develop a sheaf cohomology of definable…

Algebraic Geometry · Mathematics 2022-11-22 Pablo Cubides Kovacsics , Mário Edmundo , Jinhe Ye

The chase algorithm is a fundamental tool for query evaluation and query containment under constraints, where the constraints are (sub-classes of) tuple-generating dependencies (TGDs) and equality generating depencies (EGDs). So far, most…

Logic in Computer Science · Computer Science 2013-11-19 Andrea Cali , Georg Gottlob , Michael Kifer

We give an analysis and generalizations of some long-established constructive completeness results in terms of categorical logic and pre-sheaf and sheaf semantics. The purpose is in no small part conceptual and organizational: from a few…

Logic · Mathematics 2017-09-19 Henrik Forssell , Christian Espíndola

Using a geometric argument building on our new theory of graded sheaves, we compute the categorical trace and Drinfel'd center of the (graded) finite Hecke category $\mathsf{H}_W^\mathsf{gr} = \mathsf{Ch}^b(\mathsf{SBim}_W)$ in terms of the…

Representation Theory · Mathematics 2025-08-20 Quoc P. Ho , Penghui Li

Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…

Logic in Computer Science · Computer Science 2009-12-15 Christine Tasson

Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can…

Programming Languages · Computer Science 2007-05-23 Roberto Bagnara , Roberta Gori , Patricia M. Hill , Enea Zaffanella

We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…

Logic · Mathematics 2024-02-22 Jouko Vaananen , Boban Velickovic

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

Logic in Computer Science · Computer Science 2023-06-22 Simon Docherty , David Pym

Let $k$ be an algebraically closed field of characteristic $p\ge 0$. Let $G$ be an affine group scheme over $k$. We classify the indecomposable exact module categories over the rigid tensor category $\text{Coh}_f(G)$ of coherent sheaves of…

Quantum Algebra · Mathematics 2013-01-22 Shlomo Gelaki

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

Logic · Mathematics 2024-05-22 Vera Fischer , Corey Bacal Switzer

We study the character of the infinite wedge projective representation of the algebra of differential operators on the circle. We prove quasi-modularity of this character and also compute certain generating functions for traces of…

alg-geom · Mathematics 2007-05-23 Spencer Bloch , Andrei Okounkov

We use the algebraic framework for languages of infinite trees introduced in [4] to derive effective characterisations of various temporal logics, in particular the logic EF (a fragment of CTL) and its counting variant cEF.

Logic in Computer Science · Computer Science 2022-03-29 Achim Blumensath , Jakub Lédl

We obtain finiteness theorems for algebraic cycles of small codimension on quadric fibrations X over curves over perfect fields k. For example, if k is finitely generated over Q and the fibration has odd relative dimension at least 11, then…

Number Theory · Mathematics 2009-04-24 Cristian D. González-Avilés

We provide a proof, in $ZFC$, of Shelah's eventual categoricity conjecture for abstract elementary classes (AEC's). Moreover, assuming in addition the Singular Cardinal Hypothesis ($SCH$), we prove a direct generalization to the more…

Logic · Mathematics 2022-04-14 Christian Espíndola

Let k be a field of positive characteristic p and let G be a finite group. In this paper we study the category TsG of finitely generated commutative k-algebras A on which G acts by algebra automorphisms with surjective trace. If A = k[X],…

Representation Theory · Mathematics 2015-07-02 Peter Fleischmann , Chris Woodcock

This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…

Logic in Computer Science · Computer Science 2011-01-26 Stefan Milius , Lawrence S. Moss
‹ Prev 1 4 5 6 7 8 10 Next ›