Preview
Unable to display preview. Download preview PDF.
References
Andreka, H., Nemeti, I., Sain, I., ”Completeness problems in verification of programs and program schemes.” Mathematical Foundations of Computer Science, Springer Verlag, Vol 74, (1979), 208–218.
Kawai, H. ”Sequential calculus for a first order intinitary temporal logic”. Zeitschr. fur Math. Logic und Grundlagen der Math. Vol. 33, No5, (1987), 423–432.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pliuškevičius, R. (1990). Investigation of finitary calculi for the temporal logics by means of infinitary calculi. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029643
Download citation
DOI: https://doi.org/10.1007/BFb0029643
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive