English
Related papers

Related papers: G\"odel-Dummett linear temporal logic

200 papers

We present an elementary introduction to a new logic for reasoning about behaviors that occur over time. This logic is based on temporal type theory. The syntax of the logic is similar to the usual first-order logic; what differs is the…

Logic · Mathematics 2022-11-04 Brendan Fong , Alberto Speranzon , David I. Spivak

In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic TDS. The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be…

Logic in Computer Science · Computer Science 2019-11-19 Kees van Berkel , Tim Lyon

We introduce a new propositional logic, called very weak subintuitionistic logic $\mathbf{VF}$, by adapting the relational semantics of Fitting, Marek, and Truszczy\'nski for the pure logic of necessitation $\mathbf{N}$ to the propositional…

Logic · Mathematics 2026-05-21 Taishi Kurahashi , Mashu Noguchi

Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…

Logic in Computer Science · Computer Science 2014-04-29 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

In this paper we present a propositional logic programming language for reasoning under possibilistic uncertainty and representing vague knowledge. Formulas are represented by pairs (A, c), where A is a many-valued proposition and c is…

Artificial Intelligence · Computer Science 2013-01-18 Teresa Alsinet , Lluis Godo

The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…

Artificial Intelligence · Computer Science 2013-02-21 Luca Boldrin , Claudio Sossai

Holliday recently introduced a non-classical logic called Fundamental Logic, which intends to capture exactly those properties of the connectives "and", "or" and "not" that hold in virtue of their introduction and elimination rules in…

Logic · Mathematics 2024-06-24 Guillaume Massas

Dynamic topological logic (DTL) is a polymodal logic designed for reasoning about {\em dynamic topological systems. These are pairs (X,f), where X is a topological space and f:X->X is continuous. DTL uses a language L which combines the…

Logic · Mathematics 2012-07-24 David Fernández-Duque

In the literature, two powerful temporal logic formalisms have been proposed for expressing information flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of…

Logic in Computer Science · Computer Science 2014-09-10 Laura Bozzelli , Bastien Maubert , Sophie Pinchinat

In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic.…

Programming Languages · Computer Science 2007-05-23 Krzysztof R. Apt

One way of proving theorems in modal logics is translating them into the predicate calculus and then using conventional resolution-style theorem provers. This approach has been regarded as inappropriate in practice, because the resulting…

Logic in Computer Science · Computer Science 2021-12-30 Jian Zhang

This report first shows the equivalence bewteen several formulations of classical logic in intuitionistic logic (tertium non datur, reductio ad absurdum, Pierce's law). Then it establishes the correctness of the G\"odel-Kolmogorov…

Logic · Mathematics 2016-02-26 Richard Moot , Christian Retoré

We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…

Logic in Computer Science · Computer Science 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

This paper shows that the fuzzy temporal logic can model figures of thought to describe decision-making behaviors. In order to exemplify, some economic behaviors observed experimentally were modeled from problems of choice containing time,…

Artificial Intelligence · Computer Science 2019-02-18 José Cláudio do Nascimento

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…

Logic · Mathematics 2025-03-31 Aleksi Anttila , Søren Brinck Knudstorp

In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…

Logic in Computer Science · Computer Science 2021-10-22 Davide Castelnovo , Marino Miculan

Fundamental logic was introduced by Wesley Holliday (2023) to unify intuitionistic logic and quantum logic from a proof-theoretic perspective, capturing the logic determined solely by the introduction and elimination rules of connectives…

Logic · Mathematics 2026-02-03 Zhicheng Chen

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

We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…

Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments…

Logic in Computer Science · Computer Science 2012-10-10 Davide Bresolin , Dario Della Monica , Angelo Montanari , Pietro Sala , Guido Sciavicco
‹ Prev 1 8 9 10 Next ›