Szalas, Andrzej Holenderski, Leszek 1988 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 57, no 2-3, 317-325Article in journal (Refereed) Published
The results presented in this paper concern the axiomatizability problem of first-order temporal logic with linear and discrete time. We show that the logic is incomplete, i.e., it cannot be provided with a finitistic and complete proof system. We show two incompleteness theorems. Although the first one is weaker (it assumes some first-order signature), we decided to present it, for its proof is much simpler and contains an interesting fact that finite sets are characterizable by means of temporal formulas. The second theorem shows that the logic is incomplete independently of any particular signature.
National CategoryEngineering and Technology
Identifiersurn:nbn:se:liu:diva-74991 (URN)10.1016/0304-3975(88)90045-X (DOI)oai:DiVA.org:liu-74991 (OAI)diva2:499746 (DiVA)