English
Related papers

Related papers: {\L}ukasiewicz {\mu}-calculus

200 papers

The aim of the paper is to analyze the expressive power of the square operator of Lukasiewicz logic: $\ast x=x\odot x$, where $\odot$ is the strong Lukasiewicz conjunction. In particular, we aim at understanding and characterizing those…

Logic · Mathematics 2021-03-16 Marcelo E. Coniglio , Francesc Esteva , Tommaso Flaminio , Lluis Godo

Recently, Miller and Wu introduced the positive $\lambda$-calculus, a call-by-value $\lambda$-calculus with sharing obtained by assigning proof terms to the positively polarized focused proofs for minimal intuitionistic logic. The positive…

Logic in Computer Science · Computer Science 2024-12-18 Beniamino Accattoli , Jui-Hsuan Wu

Behavioural distances generally offer more fine-grained means of comparing quantitative systems than two-valued behavioural equivalences. They often relate to quantitative modalities, which generate quantitative modal logics that…

Logic in Computer Science · Computer Science 2026-02-13 Jonas Forster , Lutz Schröder , Paul Wild , Barbara König , Pedro Nora

I explain a direct approach to differentiation and integration. Instead of relying on the general notions of real numbers, limits and continuity, we treat functions as the primary objects of our theory, and view differentiation as division…

History and Overview · Mathematics 2009-05-25 Michael Livshits

We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz…

Logic in Computer Science · Computer Science 2023-06-22 Robert Furber , Radu Mardare , Matteo Mio

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…

Logic · Mathematics 2015-07-01 George Metcalfe , Nicola Olivetti

Noncommutative rational functions appeared in many contexts in system theory and control, from the theory of finite automata and formal languages to robust control and LMIs. We survey the construction of noncommutative rational functions,…

Rings and Algebras · Mathematics 2015-03-13 Dmitry S. Kaliuzhnyi-Verbovetskyi , Victor Vinnikov

In this paper, once recalled some properties of CMV-algebras, we introduce an expansion of the one-variable fragment of Lukasiewicz propositional logic whose algebraic semantics is the variety of CMV-algebras.

Logic · Mathematics 2011-09-21 Antonio Di Nola , Brunella Gerla , Ciro Russo

A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…

Logic in Computer Science · Computer Science 2023-06-22 Denisa Diaconescu , George Metcalfe , Laura Schnüriger

In this paper, we study the Kurdyka-{\L}ojasiewicz (KL) exponent, an important quantity for analyzing the convergence rate of first-order methods. Specifically, we develop various calculus rules to deduce the KL exponent of new (possibly…

Optimization and Control · Mathematics 2021-08-31 Guoyin Li , Ting Kei Pong

We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…

Logic · Mathematics 2024-08-15 Dag Normann , Sam Sanders

A consistent functional calculus approach to the spectral theorem for strongly commuting normal operators on Hilbert spaces is presented. In contrast to the common approaches using projection-valued measures or multiplication operators,…

Functional Analysis · Mathematics 2020-09-28 Markus Haase

This paper presents the first model-checking algorithm for an expressive modal mu-calculus over timed automata, $L^{\mathit{rel}, \mathit{af}}_{\nu,\mu}$, and reports performance results for an implementation. This mu-calculus contains…

Formal Languages and Automata Theory · Computer Science 2014-08-29 Peter Fontana , Rance Cleaveland

We study the Kronecker coefficients $g_{\lambda, \mu, \nu}$ via a formula that was described by Mishna, Rosas, and Sundaram, in which the coefficients are expressed as a signed sum of vector partition function evaluations. In particular, we…

Combinatorics · Mathematics 2022-10-24 Marni Mishna , Stefan Trandafir

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

Logic · Mathematics 2023-11-08 Robert Goldblatt , Ian Hodkinson

This paper is a concise and painless introduction to the $\lambda$-calculus. This formalism was developed by Alonzo Church as a tool for studying the mathematical properties of effectively computable functions. The formalism became popular…

Logic in Computer Science · Computer Science 2015-04-01 Raul Rojas

We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging…

Logic in Computer Science · Computer Science 2014-05-05 Alessandro Artale , Roman Kontchakov , Vladislav Ryzhikov , Michael Zakharyaschev

This survey provides a unified discussion of multiple integrals, moments, cumulants and diagram formulae associated with functionals of completely random measures. Our approach is combinatorial, as it is based on the algebraic formalism of…

Probability · Mathematics 2008-11-12 Giovanni Peccati , Murad S. Taqqu

Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express metric constraints. A seminal result of Hirshfeld and Rabinovich shows that over the…

Logic in Computer Science · Computer Science 2013-02-19 Paul Hunter , Joël Ouaknine , James Worrell

We extend the matrix-resolvent method for computing logarithmic derivatives of tau-functions to the Ablowitz--Ladik hierarchy. In particular, we derive a formula for the generating series of the logarithmic derivatives of an arbitrary…

Mathematical Physics · Physics 2022-05-04 Mattia Cafasso , Di Yang
‹ Prev 1 4 5 6 7 8 10 Next ›