Szalas, Andrzej 1987 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 54, no 2-3, 199-214Artikel i tidskrift (Refereed) Published
As shown in (Szalas, 1986, 1986, 1987) there is no finitistic and complete axiomatization of First-Order Temporal Logic of linear and discrete time. In this paper we give an infinitary proof system for the logic. We prove that the proof system is sound and complete. We also show that any syntactically consistent temporal theory has a model. As a corollary we obtain that the Downward Theorem of Skolem, Lowenheim and Tarski holds in the case of considered logic.
Algebra of Lindenbaum and Tarski | Boolean algebra | completeness | consistency | First-Order Temporal Logic | Kripke structure | model | proof system | semantic consequence | soundness | syntactic consequence
National CategoryEngineering and Technology
Identifiersurn:nbn:se:liu:diva-74971 (URN)10.1016/0304-3975(87)90129-0 (DOI)oai:DiVA.org:liu-74971 (OAI)