Related papers: On Guarded Transformation In The Modal Mu-Calculus
$\omega$-regular energy games, which are weighted two-player turn-based games with the quantitative objective to keep the energy levels non-negative, have been used in the context of verification and synthesis. The logic of modal…
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…
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…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
We consider transformations of normal form games by binding preplay offers of players for payments of utility to other players conditional on them playing designated in the offers strategies. The game-theoretic effect of such preplay offers…
A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the…
In this paper we study the generalized variable-coefficient Gardner equations of the form $u_t + A(t)u^n\,u_x+ C(t)\,u^{2n}u_x + B(t)\,u_{xxx} + Q(t)\,u =0$. This class broadens out many other equations previously considered: Johnpillai and…
Matrices over the ring of formal power series are considered. Normal forms with respect to various sub-groups of the two-sided transformations are constructed. The construction is based on the special property of the action: it induces a…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
The modal mu-calculus is obtained by adding least and greatest fixed-point operators to modal logic. Its alternation hierarchy classifies the mu-formulas by their alternation depth: a measure of the codependence of their least and greatest…
The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question in the case of second-order λ$\mu$-calculus, which can be…
We construct an auto-validated algorithm that calculates a close to identity change of variables which brings a general saddle point into a normal form. The transformation is robust in the underlying vector field, and is analytic on a…
We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…
We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…
We propose a theoretical formulation of protected edge modes in the language of quantum field theories based on the contemporary understanding of the renormalization group. We use bulk and boundary renormalization arguments which have never…
It is demonstrated that quasi-exactly solvable models of quantum mechanics admit an interesting duality transformation which changes the form of their potentials and inverts the sign of all the exactly calculable energy levels. This…
Parikh's game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
Many Generalized Uncertainty Principle (GUP) models modify the inner-product measure to ensure symmetric position or momentum operators. We show that an alternate approach to these GUPs is to symmetrize the operators rather than modifying…
The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS). Two semantics have been studied for this logic, both assigning to every…