Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T06:39:51.053Z Has data issue: false hasContentIssue false

Logical consecutions in discrete linear temporal logic

Published online by Cambridge University Press:  12 March 2014

V. V. Rybakov*
Affiliation:
Department of Computing and Mathematics, Manchester Metropolitan University, John Dalton Building, Chester Street, Manchester M1 5GD, UK, E-mail: V.Rybakov@mmu.ac.uk

Abstract

We investigate logical consequence in temporal logics in terms of logical consecutions, i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be ‘correct’ in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈L ≤, ≥〉 of all integer numbers, is the prime object of our investigation. We describe consecutions admissible in LDTL in a semantic way—via consecutions valid in special temporal Kripke/Hintikka models. Then we state that any temporal inference rule has a reduced normal form which is given in terms of uniform formulas of temporal degree 1. Using these facts and enhanced semantic techniques we construct an algorithm, which recognizes consecutions admissible in LDTL. Also, we note that using the same technique it follows that the linear temporal logic L(N) of all natural numbers is also decidable w.r.t. inference rules. So, we prove that both logics LDTL and L(N) are decidable w.r.t. admissible consecutions. In particular, as a consequence, they both are decidable (known fact), and the given deciding algorithms are explicit.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable