A Presheaf Semantics for Quantified Temporal Logics

11/06/2021
by   Fabio Gadducci, et al.
0

Temporal logics stands for a widely adopted family of formalisms for the verification of computational devices, enriching propositional logics by operators predicating on the step-wise behaviour of a system. Its quantified extensions allow to reason on the properties of the individual components of the system at hand. The expressiveness of the resulting logics poses problems in correctly identifying a semantics that exploit its features without resorting to the imposition of restrictions on the acceptable behaviours. In this paper we address this issue by means of counterpart models and relational presheaves.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2021

Topological semantics for paraconsistent and paracomplete logics in Isabelle/HOL

We encode a topological semantics for paraconsistent and paracomplete lo...
research
02/18/2019

Appendix for: Cut-free Calculi and Relational Semantics for Temporal STIT logics

This paper is an appendix to the paper "Cut-free Calculi and Relational ...
research
05/05/2023

Specification and verification of a linear-time logic for graph transformation

We present a first-order linear-time temporal logic for reasoning about ...
research
04/22/2019

Cut-free Calculi and Relational Semantics for Temporal STIT Logics

We present cut-free labelled sequent calculi for a central formalism in ...
research
04/21/2023

Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity

We introduce and develop a set-based semantics for asynchronous TeamLTL....
research
11/10/2017

Logics for modelling collective attitudes

We introduce a number of logics to reason about collective propositional...
research
04/14/2022

Dunn Semantics for Contra-Classical Logics

In this paper I show, with a rich and systematized diet of examples, tha...

Please sign up or login with your details

Forgot password? Click here to reset