English
Related papers

Related papers: On Guarded Transformation In The Modal Mu-Calculus

200 papers

In game theory, players have continuous expected payoff functions and can use fixed point theorems to locate equilibria. This optimization method requires that players adopt a particular type of probability measure space. Here, we introduce…

Optimization and Control · Mathematics 2007-05-23 Michael J. Gagen , Kae Nemoto

Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since Q may…

Logic in Computer Science · Computer Science 2019-03-14 Vince Bárány , Georg Gottlob , Martin Otto

As a cornerstone of automated reasoning, equational reasoning finds equivalences between symbolic expressions and fuels advances across scientific disciplines. Yet, its potential remains limited by the exponential growth of equivalent…

Quantum Physics · Physics 2026-05-19 Davide Rattacaso , Daniel Jaschke , Marco Ballarin , Ilaria Siloi , Simone Montangero

We present a formalism to study screening mechanisms in modified theories of gravity via perturbative methods in different cosmological scenarios. We consider Einstein frame posed theories that are recast as Jordan frame theories, where a…

Cosmology and Nongalactic Astrophysics · Physics 2019-01-30 Alejandro Aviles , Jorge L. Cervantes-Cota , David F. Mota

We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and…

Logic in Computer Science · Computer Science 2024-03-06 Alejandro Díaz-Caro , Emmanuel Hainry , Romain Péchoux , Mário Silva

The forced soliton equation is the starting point for semiclassical computations with solitons away from the small momentum transfer regime. This paper develops necessary analytical and numerical tools for analyzing solutions to the forced…

High Energy Physics - Theory · Physics 2025-01-07 Zachary J. Allamon , Quentin A. Hales , Andrew B. Royston , Douglas L. Rutledge , Erica A. Yozie

A quantum deformed theory applicable to all shape-invariant bound-state systems is introduced by defining q-deformed ladder operators. We show these new ladder operators satisfy new q-deformed commutation relations. In this context we…

Mathematical Physics · Physics 2008-11-26 A. N. F. Aleixo , A. B. Balantekin , M. A. Candido Ribeiro

Through second order in perturbative general relativity, a small compact object in an external vacuum spacetime obeys a generalized equivalence principle: although it is accelerated with respect to the external background geometry, it is in…

General Relativity and Quantum Cosmology · Physics 2015-09-08 Adam Pound

The role of gauge invariance is reconsidered by "deriving it without assuming it" within an autonomous approach to interactions of Standard Model particles. In this approach, the renormalizable interactions are purely constrained by quantum…

High Energy Physics - Theory · Physics 2026-05-26 Karl-Henning Rehren

Substitution resolution supports the computational character of $\beta$-reduction, complementing its execution with a capture-avoiding exchange of terms for bound variables. Alas, the meta-level definition of substitution, masking a…

Logic in Computer Science · Computer Science 2018-12-12 Maciej Bendkowski

In a recent work, Moshkovitz [FOCS '14] presented a transformation on two-player games called "fortification", and gave an elementary proof of an (exponential decay) parallel repetition theorem for fortified two-player projection games. In…

Quantum Physics · Physics 2016-03-18 Mohammad Bavarian , Thomas Vidick , Henry Yuen

We present a \emph{pairwise normal form} for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared…

Logic in Computer Science · Computer Science 2008-01-07 Paul C. Attie

Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type. However, popular…

Logic in Computer Science · Computer Science 2016-06-10 Lutz Schröder , Yde Venema

When studying families in the moduli space of dynamical systems, choosing an appropriate representative function for a conjugacy class can be a delicate task. The most delicate questions surround rationality of the conjugacy class compared…

Dynamical Systems · Mathematics 2023-11-08 Heidi Benham , Alexander Galarraga , Benjamin Hutz , Joey Lupo , Wayne Peng , Adam Towsley

Modern programming frequently requires generalised notions of program equivalence based on a metric or a similar structure. Previous work addressed this challenge by introducing the notion of a V-equation, i.e. an equation labelled by an…

Logic in Computer Science · Computer Science 2024-02-14 Fredrik Dahlqvist , Renato Neves

The regularized signum-Gordon potential has a smooth minimum and is linear in the modulus of the field value for higher amplitudes. The Q-ball solutions in this model are investigated. Their existence for charges large enough is…

High Energy Physics - Theory · Physics 2010-09-16 Jakub Lis

Motivated by the recent interest in models of guarded (co-)recursion, we study their equational properties. We formulate axioms for guarded fixpoint operators generalizing the axioms of iteration theories of Bloom and \'Esik. Models of…

Logic in Computer Science · Computer Science 2018-08-21 Stefan Milius , Tadeusz Litak

For an algebraically closed field $\mathbb{K}$, we consider a Galois $G$-covering $\mathcal{B} \to \mathcal{A}$ between locally bounded $\mathbb{K}$-categories given by bound quivers, where $G$ is torsion-free and acts freely on the objects…

Representation Theory · Mathematics 2024-10-30 Charles Paquette , Deepanshu Prasad , David Wehlau

We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…

Logic in Computer Science · Computer Science 2026-03-25 Daniel Gratzer

We give a graded version of the M\"obius inversion formula in the framework of trace monoids. The formula is based on a graded version of the M\"obius transform, related to the notion of height deriving from the Cartier-Foata normal form of…

Combinatorics · Mathematics 2015-05-05 Samy Abbes
‹ Prev 1 4 5 6 7 8 10 Next ›