English
Related papers

Related papers: A temporal semantics for Nilpotent Minimum logic

200 papers

Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We…

Logic in Computer Science · Computer Science 2015-07-01 Ben Moszkowski

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of…

Logic in Computer Science · Computer Science 2019-11-19 Fabrizio M. Maggi , Marco Montali , Rafael Peñaloza

We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of…

Logic in Computer Science · Computer Science 2019-03-14 Bartek Klin , Jurriaan Rot

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…

Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various parameters. All the logics considered involve the discrete…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Ron van der Meyden , Moshe Y. Vardi

This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…

Logic · Mathematics 2023-11-28 Anton Freund

We provide a generalisation of Kripke semantics for Petr Hajek's Basic Logic and prove soundness and completeness of the same with respect to our semantics. We find this semantics easily specialises to the linearly-ordered Kripke frames for…

Logic in Computer Science · Computer Science 2023-08-10 Andrew Lewis-Smith

A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…

Logic in Computer Science · Computer Science 2025-11-14 Kenji Tokuo

We provide a logical characterization of non-deterministic polynomial time defined by BSS machines over semirings via existential second-order logic interpreted in the semiring semantics developed by Gr\"adel and Tannen. Furthermore, we…

Logic in Computer Science · Computer Science 2025-10-01 Timon Barlag , Nicolas Fröhlich , Teemu Hankala , Miika Hannula , Minna Hirvonen , Vivian Holzapfel , Juha Kontinen , Arne Meier , Laura Strieker

We introduce an expressive probabilistic temporal epistemic logic PTEL suitable to reason about uncertain knowledge of a non-rigid set of agents that can be changed during time. We define semantics for PTEL as Kripke models with epistemic…

Logic · Mathematics 2021-05-27 Zoran Ognjanović , Angelina Ilić Stepić , Aleksandar Perović

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

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed…

Artificial Intelligence · Computer Science 2011-05-30 A. Artale , E. Franconi

A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…

Logic · Mathematics 2018-05-09 Tianheng Tsui

In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…

Rings and Algebras · Mathematics 2014-03-26 Jouni Järvinen , Piero Pagliani , Sándor Radeleczki

This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures…

Logic in Computer Science · Computer Science 2021-08-12 Nils Kürbis

We present a first-order linear-time temporal logic for reasoning about the evolution of directed graphs. Its semantics is based on the counterpart paradigm, thus allowing our logic to represent the creation, duplication, merging, and…

Logic in Computer Science · Computer Science 2023-05-09 Fabio Gadducci , Andrea Laretto , Davide Trotta

In this paper we present various temporal justification logics involving both past and future time modalities. We combine Artemov's logic of proofs with linear temporal logic (with both past and future operators), and establish its…

Logic in Computer Science · Computer Science 2025-01-17 Meghdad Ghari

We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of {\L}ukasiewicz many-valued…

Logic in Computer Science · Computer Science 2014-01-29 Bruno Teheux

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

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