English
Related papers

Related papers: A temporal semantics for Nilpotent Minimum logic

200 papers

Following the lines of the analysis done in [BPZ07, BCF07] for first-order G\"odel logics, we present an analogous investigation for Nilpotent Minimum logic NM. We study decidability and reciprocal inclusion of various sets of first-order…

Logic · Mathematics 2012-07-03 Matteo Bianchi

We investigate a version of linear temporal logic whose propositional fragment is G\"odel-Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural semantics:…

Logic in Computer Science · Computer Science 2023-06-29 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic…

Logic in Computer Science · Computer Science 2015-03-17 Ahmet Kara , Thomas Schwentick , Thomas Zeume

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…

Logic in Computer Science · Computer Science 2022-12-05 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

We investigate a non-classical version of linear temporal logic whose propositional fragment is G\"odel--Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural…

Logic in Computer Science · Computer Science 2023-01-30 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and…

Artificial Intelligence · Computer Science 2023-03-24 Didier Dubois , Lluis Godo , Henri Prade

The language of linear temporal logic can be interpreted over the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${{\sf ITL}^{\sf c}}_{\Diamond,\forall}$, recently shown to be decidable by…

Logic in Computer Science · Computer Science 2019-10-03 Joseph Boudou , Martín Diéguez , David Fernández-Duque

LTL3 is a multi-valued variant of Linear-time Temporal Logic for runtime verification applications. The semantic descriptions of LTL3 in previous work are given only in terms of the relationship to conventional LTL. Our approach, by…

Logic in Computer Science · Computer Science 2024-11-25 Rayhana Amjad , Rob van Glabbeek , Liam O'Connor

We introduce a two-dimensional metric (interval) temporal logic whose internal and external time flows are dense linear orderings. We provide a suitable semantics and a sequent calculus with axioms for equality and extralogical axioms. Then…

Logic · Mathematics 2019-03-15 Stefano Baratella , Andrea Masini

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…

Logic in Computer Science · Computer Science 2020-11-20 Aldo Figallo-Orellano , Juan Sebastian Slagter

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…

Logic in Computer Science · Computer Science 2013-09-05 Matteo Mio , Alex Simpson

Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

In this paper we propose a many-valued temporal conditional logic. We start from a many-valued logic with typicality, and extend it with the temporal operators of the Linear Time Temporal Logic (LTL), thus providing a formalism which is…

Logic in Computer Science · Computer Science 2024-09-17 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will…

Computational Complexity · Computer Science 2024-06-14 Sebastian Oberhoff

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2019-11-20 Laura Bozzelli , Aniello Murano , Adriano Peron

We introduce a family of modal expansions of {\L}ukasiewicz logic that are designed to accommodate modal translations of generalized basic logic (as formulated with exchange, weakening, and falsum). We further exhibit algebraic semantics…

Logic · Mathematics 2021-06-11 Wesley Fussner , William Zuluaga Botero

In 1932, G\"odel proved that there is no finite semantics for intuitionistic logic. We consider all fragments of intuitionistic logic and check in each case whether a finite semantics exists. We may fulfill a didactic goal, as little logic…

Logic · Mathematics 2019-03-13 Felipe S. Albarelli , Rodolfo Ertola-Biraben

We define temporal axioms that are sound and complete for the temporal validities over $(\reals^2, <)$.

Logic · Mathematics 2024-05-24 Robin Hirsch
‹ Prev 1 2 3 10 Next ›