English
Related papers

Related papers: Sahlqvist-Type Completeness Theory for Hybrid Logi…

200 papers

Kazhdan and Lusztig identified the affine Hecke algebra $\mathcal{H}$ with an equivariant $K$-group of the Steinberg variety, and applied this to prove the Deligne-Langlands conjecture, i.e., the local Langlands parametrization of…

Representation Theory · Mathematics 2024-05-28 David Ben-Zvi , Harrison Chen , David Helm , David Nadler

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…

Logic · Mathematics 2025-12-08 Ruiyuan Chen , David Gonzalez , Matthew Harrison-Trainor

We show that an exact Lagrangian cobordism $L\subset \mathbb R \times P \times \mathbb R$ from a Legendrian submanifold $\Lambda\subset P\times \mathbb R$ to itself satisfies $H_i(L;\mathbb F)=H_i(\Lambda;\mathbb F)$ for any field $\mathbb…

Symplectic Geometry · Mathematics 2015-12-09 Georgios Dimitroglou Rizell , Roman Golovko

In relational verification, judicious alignment of computational steps facilitates proof of relations between programs using simple relational assertions. Relational Hoare logics (RHL) provide compositional rules that embody various…

Logic in Computer Science · Computer Science 2023-07-21 Anindya Banerjee , Ramana Nagasamudram , David A. Naumann

In a previous work, by extending the classical Quillen construction to the non-simply connected case, we have built a pair of adjoint functors, 'model' and 'realization', between the categories of simplicial sets and complete differential…

Algebraic Topology · Mathematics 2018-10-22 Urtzi Buijs , Yves Félix , Aniceto Murillo , Daniel Tanré

We study $p$-adic properties of the coherent cohomology of some automorphic sheaves on the Hilbert modular variety $X$ for a totally real field $F$ in the case where the prime $p$ is totally split in $F$. More precisely, we develop higher…

Number Theory · Mathematics 2025-09-23 Giada Grossi

The paper studies the containment companion of a logic $\vdash$. This consists of the consequence relation $\vdash^{r}$ which satisfies all the inferences of $\vdash$, where the variables of the conclusion are \emph{contained} into those of…

Logic · Mathematics 2020-05-05 Stefano Bonzio , Michele Pra Baldi

\emph{Proto-exact categories}, introduced by Dyckerhoff and Kapranov, are a generalization of Quillen exact categories which provide a framework for defining algebraic K-theory and Hall algebras in a \emph{non-additive} setting. This…

Category Theory · Mathematics 2022-02-04 Jaiung Jun , Matt Szczesny , Jeffrey Tolliver

The aim of this paper is to extend the classical Larson-Sweedler theorem, namely that a k-bialgebra has a non-singular integral (and in particular is Frobenius) if and only if it is a finite dimensional Hopf algebra, to the `many-object'…

Category Theory · Mathematics 2020-10-19 Mitchell Buckley , Timmy Fieremans , Christina Vasilakopoulou , Joost Vercruysse

We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…

Logic · Mathematics 2026-04-14 Jim de Groot , Ian Shillito , Ranald Clouston

To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…

Logic · Mathematics 2016-09-14 Ian Payne

We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…

Logic in Computer Science · Computer Science 2023-08-08 Anuj Dawar , Lauri Hella

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the…

Logic in Computer Science · Computer Science 2015-03-13 Arne Meier , Martin Mundhenk , Thomas Schneider , Michael Thomas , Volker Weber , Felix Weiss

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Logic in Computer Science · Computer Science 2013-12-11 M. Cialdea Mayer

In this paper, we establish a structure theorem for connected graded Hopf algebras over a field of characteristic $0$ by claiming the existence of a family of homogeneous generators and a total order on the index set that satisfy some…

Rings and Algebras · Mathematics 2020-06-29 G. -S. Zhou , Y. Shen , D. -M. Lu

A recent strand of research in structural proof theory aims at exploring the notion of analytic calculi (i.e. those calculi that support general and modular proof-strategies for cut elimination), and at identifying classes of logics that…

Logic in Computer Science · Computer Science 2021-02-24 Jinsheng Chen , Giuseppe Greco , Alessandra Palmigiano , Apostolos Tzimoulis

We provide a simple extension of Bolthausen's Morita type proof of the replica symmetric formula [E. Bolthausen, Stat. Mech. of Classical and Disordered Systems, pp. 63-93 (2018)] for the Sherrington-Kirkpatrick model and prove the replica…

Mathematical Physics · Physics 2022-07-20 Christian Brennecke , Horng-Tzer Yau

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…

Logic · Mathematics 2019-02-04 Christian Espíndola

In relational verification, judicious alignment of computational steps facilitates proof of relations between programs using simple relational assertions. Relational Hoare logics (RHL) provide compositional rules that embody various…

Logic in Computer Science · Computer Science 2025-11-12 Ramana Nagasamudram , Anindya Banerjee , David A. Naumann