Abstract The Distributed Temporal Logic DTL allows one to reason about temporal
properties of a distributed system from the local point of view of the system's agents, which …

We propose an approach for defining labeled natural deduction systems for the class of
Peircean branching temporal logics, seen as logics in their own right rather than as sub …

We propose an indexed natural deduction system for the modal logic S5, ideally following
Wansing's previous work in the context of tableaux sequents. The system, given both in the …

We extend to natural deduction the approach of Linear Nested Sequents and of 2-Sequents.
Formulas are decorated with a spatial coordinate, which allows a formulation of formal …

We present a syntactical cut-elimination proof for an extended sequent calculus covering the
classical modal logics in the\(\mathsf {K}\),\(\mathsf {D}\),\(\mathsf {T}\),\(\mathsf …

Until is a notoriously difficult temporal operator as it is both existential and universal at the
same time: A∪ B holds at the current time instant w iff either B holds at w or there exists a …

We present a new logic called Ockhamist Propositional Dynamic Logic, OPDL, which
provides a natural link between PDL and CTL*. We show that both PDL and CTL* can be …

This article concerns the treatment of propositional quantification in a framework of labelled
natural deduction for modal logic developed by Basin, Matthews and Viganò. We provide a …

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent
calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented …

We introduce a natural deduction system for the until-free subsystem of the branching time
logic Although we work with labelled formulas, our system differs conceptually from the …