English
Related papers

Related papers: Complete Intuitionistic Temporal Logics in Topolog…

200 papers

It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…

Logic · Mathematics 2007-06-13 Dmitry Sustretov

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

In this paper we intend to study implications in their most general form, generalizing different classes of implications including the Heyting implication, sub-structural implications and weak strict implications. Following the topological…

Logic · Mathematics 2020-04-23 Amirhossein Akbar Tabatabai

We prove that the propositional logic of intuitionistic set theory IZF is intuitionistic propositional logic IPC. More generally, we show that IZF has the de Jongh property with respect to every intermediate logic that is complete with…

Logic · Mathematics 2019-05-14 Robert Passmann

We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, ${\sf x}$ can access ${\sf y}$ if an electromagnetic or (slower than light) mechanical signal could be sent from…

Logic · Mathematics 2017-06-13 Robin Hirsch , Mark Reynolds

Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. Ro\c{s}u first proved completeness for linear temporal logic on finite traces (LTLf) with a novel coinductive axiom. We offer a…

Logic in Computer Science · Computer Science 2021-07-14 Eric Campbell , Michael Greenberg

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…

Logic in Computer Science · Computer Science 2021-03-30 Alexandru Baltag , Johan van Benthem

We study a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…

Logic in Computer Science · Computer Science 2020-12-23 Igor Sedlár

We investigate algebraic and topological semantics of the modal logic S4CI and obtain strong completeness of the given system in the case of local semantic consequence relations. In addition, we consider an extension of the logic S4CI with…

Logic · Mathematics 2024-06-04 Daniyar Shamkanov

We consider systems under uncertainty whose dynamics are partially unknown. Our aim is to study satisfaction of temporal logic properties by trajectories of such systems. We express these properties as signal temporal logic formulas and…

Systems and Control · Electrical Eng. & Systems 2020-05-12 Ali Salamati , Sadegh Soudjani , Majid Zamani

We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the…

Logic in Computer Science · Computer Science 2015-07-01 Benedikt Bollig , Dietrich Kuske , Ingmar Meinecke

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Logic in Computer Science · Computer Science 2013-12-11 M. Cialdea Mayer

Previous work has shown that reasoning with real-time temporal logics is often simpler when restricted to models with bounded variability---where no more than v events may occur every V time units, for given v, V. When reasoning about…

Logic in Computer Science · Computer Science 2015-02-24 Carlo A. Furia , Paola Spoletini

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

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

This paper introduces a logic with a class of social network models that is based on standard Linear Temporal Logic (LTL), leveraging the power of existing model checkers for the analysis of social networks. We provide a short literature…

Social and Information Networks · Computer Science 2021-03-15 Vitor Machado , Mario Benevides

A logical model of spatiotemporal structures is pictured as a succession of processes in time. One usual way to formalize time structure is to assume the global existence of time points and then collect some of them to form time intervals…

Logic · Mathematics 2009-11-13 Kenji Tokuo

This article examines the interpretation of the LTL temporal operators over finite and infinite sequences. This is used as the basis for deriving a sound and complete axiomatization for Caret, a recent temporal logic for reasoning about…

Logic in Computer Science · Computer Science 2007-05-23 Riccardo Pucella

We investigate a class of first-order temporal-epistemic logics for reasoning about multi-agent systems. We encode typical properties of systems including perfect recall, synchronicity, no learning, and having a unique initial state in…

Multiagent Systems · Computer Science 2014-01-25 Francesco Belardinelli , Alessio Lomuscio

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…

Logic · Mathematics 2007-05-23 Frederic Dambreville