English
Related papers

Related papers: Cluster expansion and the boxdot conjecture

200 papers

Two Gentzen-style twist sequent calculi for the normal modal logic S4 are introduced and investigated. The proposed calculi, which do not employ the standard logical inference rules for the negation connective, are characterized by several…

Logic in Computer Science · Computer Science 2025-01-03 Norihiro Kamide

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Formal Languages and Automata Theory · Computer Science 2025-02-03 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Howard Straubing

The inexpressive Description Logic (DL) $\mathcal{FL}_0$, which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out that reasoning in $\mathcal{FL}_0$ w.r.t. general TBoxes is…

Artificial Intelligence · Computer Science 2021-07-28 Franz Baader , Patrick Koopmann , Friedrich Michel , Anni-Yasmin Turhan , Benjamin Zarrieß

The codimension-three conjecture states that any regular holonomic module extends uniquely beyond an analytic subset with codimension equal to or larger than three. We give a proof of this conjecture.

Algebraic Geometry · Mathematics 2013-07-30 Masaki Kashiwara , Kari Vilonen

Is it possible to write significantly smaller formulae when using Boolean operators other than those of the De Morgan basis (and, or, not, and the constants)? For propositional logic, a negative answer was given by Pratt: formulae over one…

Logic in Computer Science · Computer Science 2025-07-30 Christoph Berkholz , Dietrich Kuske , Christian Schwarz

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

We prove that the approximation conjecture of Luck holds for all amenable groups in the complex group algebra case. This result was previously proved by Dodziuk, Linnell, Mathai, Schick and Yates under the assumption that the group is…

Functional Analysis · Mathematics 2016-09-07 Gabor Elek

In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the…

Logic in Computer Science · Computer Science 2023-06-22 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

Category Theory · Mathematics 2015-07-22 Martin Hyland

We propose a "modal linear logic" to reformulate intuitionistic modal logic S4 (IS4) in terms of linear logic, establishing an S4-version of Girard translation from IS4 to it. While the Girard translation from intuitionistic logic to linear…

Logic in Computer Science · Computer Science 2019-04-25 Yosuke Fukuda , Akira Yoshimizu

In topos theory it is well-known that any nucleus j gives rise to a translation of intuitionistic logic into itself in a way which generalises the Goedel-Gentzen negative translation. Here we show that there exists a similar j-translation…

Logic · Mathematics 2018-08-03 Benno van den Berg

We lift the SCL calculus for first-order logic without equality to the SCL(T) calculus for first-order logic without equality modulo a background theory. In a nutshell, the SCL(T) calculus describes a new way to guide hierarchic resolution…

Logic in Computer Science · Computer Science 2020-10-23 Martin Bromberger , Alberto Fiori , Christoph Weidenbach

We consider the HRT conjecture in the mixed-integer setting, where a finite configuration in $\R^d\times\R^d$ consists of $N-1$ points in $\Z^d\times\Z^d$ and one point $(\alpha,\beta)$ outside the lattice. Assuming a linear dependence…

Dynamical Systems · Mathematics 2026-03-18 Vignon Oussa

Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…

Logic · Mathematics 2025-01-01 Vladislav Sliusarev

We prove a strong conceptual completeness theorem (in the sense of Makkai) for the infinitary logic $\mathcal L_{\omega_1\omega}$: every countable $\mathcal L_{\omega_1\omega}$-theory can be canonically recovered from its standard Borel…

Logic · Mathematics 2019-08-06 Ruiyuan Chen

Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof…

Logic in Computer Science · Computer Science 2023-05-11 Zhibo Chen , Frank Pfenning

We investigate various connections between the clustering for the Burrows-Wheeler transform, a lossless algorithm used in data compression, and languages of interval exchange transformations. We show that a primitive word $u$ clusters for a…

Combinatorics · Mathematics 2026-03-18 Sébastien Ferenczi , Luca Q. Zamboni

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

Logic · Mathematics 2020-09-22 Joel David Hamkins , Wojciech Aleksander Wołoszyn

We show that for various natural classes of groups and appropriately defined K- and L-theoretic functors, injectivity or bijectivity of the assembly map follows from the Isomorphism Conjecture being true for acyclic groups lying within that…

K-Theory and Homology · Mathematics 2017-03-07 Crichton Ogle , Shengkui Ye

Loebl, Koml\'os and S\'os conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this…

Combinatorics · Mathematics 2017-07-31 Jan Hladky , Diana Piguet , Miklos Simonovits , Maya Stein , Endre Szemeredi