Injecting Finiteness to Prove Completeness for Finite Linear Temporal Logic

07/13/2021
by   Eric Campbell, et al.
0

Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. Roşu first proved completeness for linear temporal logic on finite traces (LTLf) with a novel coinductive axiom. We offer a different proof, with fewer, more conventional axioms. Our proof is a direct adaptation of Kröger and Merz's Henkin-Hasenjaeger-style proof. The essence of our adaption is that we "inject" finiteness: that is, we alter the proof structure to ensure that models are finite. We aim to present a thorough, accessible proof.

READ FULL TEXT
research
02/01/2022

First-order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications

Formalisms based on temporal logics interpreted over finite strict linea...
research
02/14/2020

Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics

The preferential conditional logic PCL, introduced by Burgess, and its e...
research
03/12/2019

Probabilistic Temporal Logic over Finite Traces (Technical Report)

Temporal logics over finite traces have recently gained attention due to...
research
08/02/2023

On Bounded Completeness and the L_1-Denseness of Likelihood Ratios

The classical concept of bounded completeness and its relation to suffic...
research
09/15/2022

Proving Hypersafety Compositionally

Hypersafety properties of arity n are program properties that relate n t...
research
01/17/2022

Skip Letters for Short Supersequence of All Permutations

A supersequence over a finite set is a sequence that contains as subsequ...
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 ...

Please sign up or login with your details

Forgot password? Click here to reset