Related papers: On Guarded Transformation In The Modal Mu-Calculus
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain…
Starting from the original Einstein action, sometimes called the Gamma squared action, we propose a new setup to formulate modified theories of gravity. This can yield a theory with second order field equations similar to those found in…
In this paper transformations for matrix orthogonal polynomials in the real line are studied. The orthogonality is understood in a broad sense, and is given in terms of a nondegenerate continuous sesquilinear form, which in turn is…
Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the…
In this paper, we investigate bounded action theories in the situation calculus. A bounded action theory is one which entails that, in every situation, the number of object tuples in the extension of fluents is bounded by a given constant,…
In this paper, we generalize modal $\mu$-calculus to the non-distributive (lattice-based) modal $\mu$-calculus and formalize some scenarios regarding categorization using it. We also provide a game semantics for the developed logic. The…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
Pattern formation in systems with a conserved quantity is considered by studying the appropriate amplitude equations. The conservation law leads to a large-scale neutral mode that must be included in the asymptotic analysis for pattern…
We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…
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…
A modified gravitational action is considered which involves the quantity $F_{\mu\nu}=\partial_{\mu}\Gamma_{\nu}-\partial_{\nu}\Gamma_{\mu}$, where $\Gamma_{\mu}=\Gamma^{\alpha}_{\mu\alpha}$. Since $\Gamma_{\mu}$ transforms like a U(1)…
One of the leading issues in quantum field theory and cosmology is the mismatch between the observed and calculated values for the cosmological constant in Einstein's field equations of up to 120 orders of magnitude. In this paper, we…
We obtain new combinatorial formulae for modified Hall--Littlewood polynomials, for matrix elements of the transition matrix between the elementary symmetric functions and Hall-Littlewood's ones, and for the number of rational points over…
Parity games are simple infinite games played on finite graphs with a winning condition that is expressive enough to capture nested least and greatest fixpoints. Through their tight relationship to the modal mu-calculus, they are used in…
Normal forms allow the use of a restricted class of coordinate transformations (typically homogeneous polynomials) to put the bifurcations found in nonlinear dynamical systems into a few standard forms. We investigate here the consequences…
This note aims to elucidate certain aspects of the quasi-position representation frequently used in the investigation of one-dimensional models based on the generalized uncertainty principle (GUP). We specifically focus on two key points:…
There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…
We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need $$\lambda$-$calculus with control due to Ariola et al. Indeed, in…
A well-defined variational principle for gravitational actions typically requires to cancel boundary terms produced by the variation of the bulk action with a suitable set of boundary counterterms. This can be achieved by carefully…
We present an extension of an algorithm for computing directly the denotation of a mu-calculus formula X over the configuration graph of a pushdown system to allow backwards modalities. Our method gives the first extension of the saturation…