Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic

  • Authors:

  • Norihiro Kamide

  • Affiliations:

  • Waseda Institute for Advanced Study, Tokyo, Japan 169-8050

  • Venue:
  • Computational Logic in Multi-Agent Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Linear-time temporal logic (LTL) is known as one of the most useful logics for verifying concurrent systems, and infinitary logic (IL) is known as an important logic for formalizing common knowledge reasoning. The research fields of both LTL and IL have independently been developed each other, and the relationship between them has not yet been discussed before. In this paper, the relationship between LTL and IL is clarified by showing an embedding of LTL into IL. This embedding shows that globally and eventually operators in LTL can respectively be represented by infinitary conjunction and infinitary disjunction in IL. The embedding is investigated by two ways: one is a syntactical way, which is based on Gentzen-type sequent calculi, and the other is a semantical way, which is based on Kripke semantics. The cut-elimination theorems for (some sequent calculi for) LTL, an infinitary linear-time temporal logic ILT *** (i.e., an integration of LTL and IL), a multi-agent infinitary epistemic linear-time temporal logic IELT *** and a multi-agent epistemic bounded linear-time temporal logic ELT l are obtained as applications of the resulting embedding theorem and its extensions and modifications. In particular, the cut-elimination theorem for IELT *** gives a new proof-theoretical basis for extremely expressive time-dependent multi-agent logical systems with common knowledge reasoning.