English
Related papers

Related papers: Size matters in the modal $\mu$-calculus

200 papers

Twenty years after its introduction by Ehrhard and Regnier, differentiation in $\lambda$-calculus and in linear logic is now a celebrated tool. In particular, it allows to establish a Taylor expansion formula for various $\lambda$-calculi,…

Logic in Computer Science · Computer Science 2025-11-26 Rémy Cerda , Lionel Vaux Auclair

This paper revisits the well-established relationship between the modal mu calculus and parity games to show that it is even more robust than previously known. It addresses the question of whether the descriptive complexity of modal mu…

Logic in Computer Science · Computer Science 2017-09-08 Karoliina Lehtinen

We first consider interval partitions whose complements are Lebesgue-null and introduce a complete metric that induces the same topology as the Hausdorff distance (between complements). This is done using correspondences between intervals.…

Probability · Mathematics 2021-01-29 Noah Forman , Soumik Pal , Douglas Rizzolo , Matthias Winkel

The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on…

Logic in Computer Science · Computer Science 2015-09-11 Martin Lange

A new formalism to express and operate on diversity measures of qualitative variables, built in a Hilbert space, is presented. The abstract character of the Hilbert space naturally incorporates the equivalence between qualitative variables…

Physics and Society · Physics 2018-05-09 Juan D. Botero , Leonardo A. Pachón

The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a…

Logic in Computer Science · Computer Science 2015-07-01 Matteo Mio

This paper defines a new pseudometric for binary relations between finite sets that measures consensus among subsets. The main results are (1) a concise restatement of this pseudometric with an intuitively appealing interpretation via a…

Geometric Topology · Mathematics 2021-09-28 Kenneth P. Ewing , Michael Robinson

This article is the second one in a series on the use of scaling invariance in finance. In the first article (cond-mat/9906048), we introduced a new formalism for the pricing of derivative securities, which focusses on tradable objects…

Condensed Matter · Physics 2007-05-23 Jiri Hoogland , Dimitri Neumann

We provide a sufficient geometric condition for $\mathbb{R}^n$ to be countably $(\mu,m)$ rectifiable of class $\mathscr{C}^{1,\alpha}$ (using the terminology of Federer), where $\mu$ is a Radon measure having positive lower density and…

Classical Analysis and ODEs · Mathematics 2018-04-26 Sławomir Kolasiński

We consider the action of a linear subspace $U$ of $\{0,1\}^n$ on the set of AC$^0$ formulas with inputs labeled by literals in the set $\{X_1,\overline X_1,\dots,X_n,\overline X_n\}$, where an element $u \in U$ acts on formulas by…

Logic in Computer Science · Computer Science 2023-06-22 Benjamin Rossman

In the modal mu-calculus, a formula is well-formed if each recursive variable occurs underneath an even number of negations. By means of De Morgan's laws, it is easy to transform any well-formed formula into an equivalent formula without…

Logic in Computer Science · Computer Science 2016-08-08 Etienne Lozes

In this paper, we provide a comprehensive rigorous modeling for multidimensional spaces with hierarchically structured dimensions in several layers of abstractions and data cubes that live in such spaces. We model cube queries and their…

Databases · Computer Science 2023-01-10 Panos Vassiliadis

A puzzling aspect of the AdS/CFT correspondence is that a single bulk operator can be mapped to multiple different boundary operators, or precursors. By improving upon a recent model of Mintun, Polchinski, and Rosenhaus, we demonstrate…

High Energy Physics - Theory · Physics 2016-05-25 Ben Freivogel , Robert A. Jefferson , Laurens Kabir

This work develops a class of relaxations in between the big-M and convex hull formulations of disjunctions, drawing advantages from both. The proposed "P-split" formulations split convex additively separable constraints into P partitions…

Optimization and Control · Mathematics 2021-02-01 Jan Kronqvist , Ruth Misener , Calvin Tsay

We characterize those pairs of weights $ \sigma $ on $ \mathbb{R}$ and $ \tau $ on $ \mathbb{C}_+$ for which the Cauchy transform $\mathsf{C}_{\sigma} f (z) \equiv \int_{\mathbb{R}} \frac {f(x)} {x-z} \; \sigma (dx)$, $ z\in \mathbb{C}_+$,…

Complex Variables · Mathematics 2018-02-13 Michael T. Lacey , Eric T. Sawyer , Chun-Yen Shen , Ignacio Uriarte-Tuero , Brett D. Wick

An accurate assessment of a model's complexity is crucial for topics such as interpretation, generalization, and model selection. However, most existing complexity measures either rely on heuristic assumptions or are computationally…

Machine Learning · Statistics 2026-05-21 Oskar Allerbo , Thomas B. Schön

Models often need to be constrained to a certain size for them to be considered interpretable. For example, a decision tree of depth 5 is much easier to understand than one of depth 50. Limiting model size, however, often reduces accuracy.…

Machine Learning · Computer Science 2020-07-02 Abhishek Ghose , Balaraman Ravindran

We initiate a study of the following problem: Given a continuous domain $\Omega$ along with its convex hull $\mathcal{K}$, a point $A \in \mathcal{K}$ and a prior measure $\mu$ on $\Omega$, find the probability density over $\Omega$ whose…

Data Structures and Algorithms · Computer Science 2020-04-17 Jonathan Leake , Nisheeth K. Vishnoi

Let $(X, \mathscr{L}, \lambda)$ and $(Y, \mathscr{M}, \mu)$ be finite measure spaces for which there exist $A \in \mathscr{L}$ and $B \in \mathscr{M}$ with either $0 < \lambda(A) < 1 < \lambda(X)$ and $0 < \mu(B) < \mu(Y)$, or the other way…

Functional Analysis · Mathematics 2023-05-08 Dorota Glazowska , Paolo Leonetti , Janusz Matkowski , Salvatore Tringali

In this paper we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement-invariant function spaces from analogous…

Functional Analysis · Mathematics 2026-02-16 Zdeněk Mihula , Luboš Pick , Daniel Spector