English
Related papers

Related papers: {\L}ukasiewicz mu-Calculus

200 papers

A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits. The…

Logic in Computer Science · Computer Science 2012-10-03 Ugo Dal Lago , Claudia Faggian

We add to intuitionistic logic infinitely many classical disjunctive tautologies and use the Curry--Howard correspondence to obtain typed concurrent $\lambda$-calculi; each of them features a specific communication mechanism, including…

Logic · Mathematics 2018-02-14 F. Aschieri , A. Ciabattoni , F. A. Genco

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

We introduce a new notion of structural refinement, a sound abstraction of logical implication, for the modal nu-calculus. Using new translations between the modal nu-calculus and disjunctive modal transition systems, we show that these two…

Logic in Computer Science · Computer Science 2014-06-11 Uli Fahrenberg , Axel Legay , Louis-Marie Traonouez

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…

Logic in Computer Science · Computer Science 2023-06-16 Oliver Görlitz , Daniel Hausmann , Merlin Humml , Dirk Pattinson , Simon Prucker , Lutz Schröder

Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes…

Logic in Computer Science · Computer Science 2015-07-01 Radu Mardare , Luca Cardelli , Kim G. Larsen

We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our…

Logic in Computer Science · Computer Science 2007-05-23 Laura Giordano , Valentina Gliozzi , Nicola Olivetti , Gian Luca Pozzato

We present a new uniform method for studying modal companions of superintuitionistic rule systems and related notions, based on the machinery of stable canonical rules. Using this method, we obtain alternative proofs of the Blok-Esakia…

Logic · Mathematics 2025-08-27 Nick Bezhanishvili , Antonio Maria Cleani

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

In this paper we introduce a term calculus ${\cal B}$ which adds to the affine $\lambda$-calculus with pairing a new construct allowing for a restricted form of contraction. We obtain a Curry-Howard correspondence between ${\cal B}$ and the…

Logic in Computer Science · Computer Science 2018-09-13 Rob Arthan , Paulo Oliva

We present a new temporal logic called Distribution Temporal Logic (DTL) defined over predicates of belief states and hidden states of partially observable systems. DTL can express properties involving uncertainty and likelihood that cannot…

Systems and Control · Computer Science 2013-10-31 Austin Jones , Mac Schwager , Calin Belta

Possibilistic conditional independence is investigated: we propose a definition of this notion similar to the one used in probability theory. The links between independence and non-interactivity are investigated, and properties of these…

Artificial Intelligence · Computer Science 2013-02-28 Pascale Fonck

We introduce a new family of temporal logics intended for specifications in motion planning (MP). It builds upon the signal temporal logic (STL), which is a linear-time logic over real-valued signals that possess quantitative semantics and…

Logic in Computer Science · Computer Science 2026-04-29 Kush Grover , Pratham Gupta , Jan Křetínský

In order to deal with the systematic verification with uncertain infromation in possibility theory, Li and Li \cite{li12} introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue,…

Logic in Computer Science · Computer Science 2014-01-21 Yongming Li , Yali Li , Zhanyou Ma

In this work we first illustrate the subjective theory of de Finetti. We recall the notion of coherence for both the betting scheme and the penalty criterion, by considering the unconditional and conditional cases. We show the equivalence…

Probability · Mathematics 2023-01-24 Angelo Gilio , Giuseppe Sanfilippo

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…

Logic in Computer Science · Computer Science 2015-03-24 Vilem Vychodil

In this paper, the formulation of Quantum Mechanics in terms of fuzzy logic and fuzzy sets is explored. A result by Pykacz, that establishes a correspondence between (quantum) logics (lattices with certain properties) and certain families…

Quantum Physics · Physics 2023-11-27 Milagrosa Aldana , María A. Lledó

We initiate a deep study of {\em Riesz MV-algebras} which are MV-algebras endowed with a scalar multiplication with scalars from $[0,1]$. Extending Mundici's equivalence between MV-algebras and $\ell$-groups, we prove that Riesz MV-algebras…

Logic · Mathematics 2013-09-09 Antonio Di Nola , Ioana Leustean

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff