English
Related papers

Related papers: Cut-elimination for the mu-calculus with one varia…

200 papers

The notion of covariant-contravariant refinement (CC-refinement, for short) is a generalization of the notions of bisimulation, simulation and refinement. This paper introduces CC-refinement modal $\mu$-calculus (CCRML$^{\mu}$) obtained…

Logic in Computer Science · Computer Science 2022-08-08 Huili Xing

We address the extension problem for quantal measures of path-integral type, concentrating on two cases: sequential growth of causal sets, and a particle moving on the finite lattice Z_n. In both cases the dynamics can be coded into a…

High Energy Physics - Theory · Physics 2011-04-11 Rafael D. Sorkin

Octonionic analysis is becoming eminent due to the role of octonions in the theory of G2 manifold. In this article, a new slice theory is introduced as a generalization of the holomorphic theory of several complex variables to the…

Complex Variables · Mathematics 2018-12-12 Guangbin Ren , Ting Yang

The two-dimensional spin-1 Baxter-Wu model is studied by using Monte Carlo simulations. The standard single-spin-flip Metropolis algorithm is used to generate the configurations from which the order parameter, specific heat and magnetic…

Classical Physics · Physics 2015-06-26 M. L. M. Costa , J. A. Plascak

For the Hamiltonian operator H = -{\Delta}+V(x) of the Schr\"odinger Equation with a repulsive potential, the problem of local decay is considered. It is analyzed by a direct method, based on a new, L^2 bounded, propagation observable. The…

Analysis of PDEs · Mathematics 2011-11-22 Avy Soffer

This paper presents a cut-elimination proof for the logic $LG^\omega$, which is an extension of a proof system for encoding generic judgments, the logic $\FOLDNb$ of Miller and Tiu, with an induction principle. The logic $LG^\omega$, just…

Logic in Computer Science · Computer Science 2008-01-22 Alwen Tiu

A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula. These disjunctive…

Logic in Computer Science · Computer Science 2021-09-20 Clemens Kupke , Johannes Marti , Yde Venema

Efficient numerical methods are required for the design of optimised devices. In magnonics, the primary computational tool is micromagnetic simulations, which solve the Landau-Lifshitz equation discretised in time and space. However, their…

Mesoscale and Nanoscale Physics · Physics 2023-07-26 Wojciech Śmigaj , Krzysztof Sobucki , Paweł Gruszecki , Maciej Krawczyk

The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed…

Logic in Computer Science · Computer Science 2017-03-08 Minghui Ma , Ahti-Veikko Pietarinen

A formalism for the numerical integration of one- and two-loop integrals is presented. It is based on subtraction terms which remove the soft, collinear and some of the ultraviolet divergences from the integrand. The numerical integral is…

High Energy Physics - Phenomenology · Physics 2012-10-08 A. Freitas

We employ a mathematical framework based on rational approximants in order to calculate meson form factors. The method profits from unitary, is systematic and data based, and is able to ascribe a systematic uncertainty which provides for…

High Energy Physics - Phenomenology · Physics 2018-02-15 Sergi Gonzàlez-Solís , Pere Masjuan , Pablo Sanchez-Puertas

The quasi-normal modal logic GLS is a provability logic formalizing the arithmetical truth. Kushida (2020) gave a sequent calculus for GLS and proved the cut-elimination theorem. This paper introduces semantical characterizations of GLS and…

Logic · Mathematics 2023-09-13 Ryo Kashima , Yutaka Kato

This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting…

Logic · Mathematics 2009-09-25 Alessandra Carbone , S. Semmes

This article reviews on-shell methods for analytic computation of loop amplitudes, emphasizing techniques based on unitarity cuts. Unitarity techniques are formulated generally but have been especially useful for calculating one-loop…

High Energy Physics - Theory · Physics 2015-05-20 Ruth Britto

The topological $\mu$-calculus has gathered attention in recent years as a powerful framework for representation of spatial knowledge. In particular, spatial relations can be represented over finite structures in the guise of weakly…

Logic · Mathematics 2023-07-31 David Fernández-Duque , Konstantinos Papafilippou

We present results concerning a lattice study of the electroweak $\rho$-parameter. We have used an SU(2)$\times$U(1) symmetric chiral Yukawa model built with Zaragoza fermions. The decoupling of the species doublers in this model is…

High Energy Physics - Lattice · Physics 2010-03-19 J. -L. Alonso , Ph. Boucaud , A. J. van der Sijs

The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…

Logic in Computer Science · Computer Science 2012-02-17 Martin Lange , Etienne Lozes

This article is concerned with the existence and multiplicity of positive weak solutions for the following fractional Kirchhoff-Choquard problem: \begin{equation*} \begin{array}{cc} \displaystyle M\left( \|u\|^2\right) (-\Delta)^s u =…

Analysis of PDEs · Mathematics 2022-12-13 Divya Goel , Sushmita Rawat , K. Sreenadh

We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes…

Logic in Computer Science · Computer Science 2023-04-24 Gilles Dowek , Olivier Hermant

Earlier we presented a method to decompose modal formulas for processes with the internal action $\tau$, and congruence formats for branching and $\eta$-bisimilarity were derived on the basis of this decomposition method. The idea is that a…

Logic in Computer Science · Computer Science 2017-12-22 Wan Fokkink , Rob van Glabbeek
‹ Prev 1 4 5 6 7 8 10 Next ›