Completeness for generalized first-order LTL

Authors:
Norihiro Kamide
Affiliations:
Waseda Institute for Advanced Study, Waseda University, Tokyo, Japan
Venue:
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Year:
2010

Citing 4
Cited 0

Reasoning about knowledge

Reasoning about knowledge
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Syntactic Cut-elimination for Common Knowledge

Electronic Notes in Theoretical Computer Science (ENTCS)
Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic

Computational Logic in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new first-order fixpoint logic, FL, is introduced as a Gentzen-type sequent calculus. FL is regarded as a generalization of the first-order linear-time temporal logic. The completeness and cutelimination theorems for FL are proved using some theorems for embedding FL into infinitary logic.