Abstract
The aim of this paper is to apply the mosaic method for proving complexity, Hilbert-style and tableau completeness results for Prior’s temporal logic over linear flows of time. We also show how to implement the mosaic idea for automated theorem-proving. Finally we indicate the modifications required to achieve similar results for special linear flows of time and for the more expressive logic of until and since.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: Proceedings of the thirteenth ACM symposium on the principles of Programming Languages, St. Petersberg Beach, Florida. ACM, New York (January 1986)
Burgess, J.P., Gurevich, Y.: The decision problem for linear temporal logic. Notre Dame J. Formal Logic 26(2), 115–128 (1985)
Fitting, M.: Proof methods for modal and intuitionistic logics. Reidel, Dordrechtz (1983)
Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1. Oxford University Press, Oxford (1994)
Goldblatt, R.: Logics of Time and Computation. In: CSLI. Lecture Notes, vol. 7. The Chicago University Press, Chicago (1987)
Goré, R.: Cut-free sequent and tableau systems for propositional Diodorean modal logics. Studia Logica 53, 433–457 (1994)
Goré, R.: Tableau methods for modal and temporal logics. In: D’Agostino, M., Gabbay, D., Hähnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 297–396. Kluwer Academic Publishers, Dordrecht (1999)
Heuerding, A., Seyfried, M., Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical logics. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS (LNAI), vol. 1071, pp. 210–225. Springer, Heidelberg (1996)
Hirsch, R., Hodkinson, I., Marx, M., Mikulás, S., Reynolds, M.: Mosaics and step-by-step. Remarks on A modal logic of relations. In: Orlowska, E. (ed.) Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa. Studies in Fuzziness and Soft Computing, vol. 24, pp. 158–167. Springer, Heidelberg (1999)
Kashima, R.: Cut-free sequent calculi for some tense logics. Studia Logica 53, 119–135 (1994)
Kamp, H.: Tense logic and the theory of linear order. PhD thesis. University of California, Los Angeles (1968)
Mikulás, S.: Taming first-order logic. Journal of the IGPL 6(2), 305–316 (1998)
Németi, I.: Free Algebras and Decidability in Algebraic Logic. PhD thesis, Hungarian Academy of Sciences, Budapest (1986) (in Hungarian)
Németi, I.: Decidable versions of first order logic and cylindric-relativized set algebras. In: Csirmaz, L., Gabbay, D., de Rijke, M. (eds.) Logic Colloquium 1992, pp. 171–241. CSLI Publications, Stanford (1995)
Ono, H., Nakamura, A.: On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica 39, 325–333 (1980)
Reynolds, M.: The complexity of the temporal logic over the reals, submitted Version available at http://www.it.murdoch.edu.au/~mark/research/online
Reynolds, M.: The complexity of the temporal logic with until over general linear time (submitted)
M. Reynolds. Online theorem-prover at http://www.it.murdoch.edu.au/~mark/research/online/demos/tempmos/TempMosApplet.html
Schmitt, P.H., Goubault-Larrecq, J.: A tableau system for linear-time temporal logic. In: Brinksma, E. (ed.) TACAS 1997. Lecture Notes in A.I, vol. 1217 Springer, Heidelberg (1997)
Sistla, A., Clarke, E.: Complexity of propositional linear temporal logics. J. ACM 32, 733–749 (1985)
Venema, Y., Marx, M.: A modal logic of relations. In: Orlowska, E. (ed.) Logic at Work. Springer, Heidelberg (1999)
Wolper, P.: The tableau method for temporal logic: an overview. Logique et Analyse (N.S.) 28 numbers (110-111), 119–136 (1985)
Zimmermann, H.: A Directed Tree Calculus for Minimal Tense Logic. Master’s Thesis, Institute for Applied Mathematics and Computer Science, University of Bern, Switzerland (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marx, M., Mikulás, S., Reynolds, M. (2000). The Mosaic Method for Temporal Logics. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_26
Download citation
DOI: https://doi.org/10.1007/10722086_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67697-3
Online ISBN: 978-3-540-45008-5
eBook Packages: Springer Book Archive