Skip to main content
SpringerLink
Log in

The Complexity of Propositional Tense Logics

  • Chapter
Diamonds and Defaults

Part of the book series: Synthese Library ((SYLI,volume 229))

Abstract

In [4], Ladner investigated the complexity of the provability problems for modal logics. In particular, he showed that provability in all modal logics between K and S4 is PSPACE-hard, and he constructed polynomial space bounded algorithms for deciding provability in K, T, and S4, which implies that the provability problems for these logics are PSPACE-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. van Benthem, The Logic of Time: a model-theoretic investigation into the varieties of temporal ontology and temporal discourse: second edition, Dordrecht, Kluwer Academic Publishers, 1991.

    Google Scholar 

  2. J. Halpern and Y. Moses, A guide to the modal logics of knowledge and belief: Preliminary report, Proceedings of the 9th International Joint Conference on Artificial Intelligence,1985, pp. 480–490, revised version to appear in Artificial Intelligence.

    Google Scholar 

  3. J. Halpern and M. Vardi, The complexity of reasoning about knowledge and time, I: Lower Bounds, J. Comput. System Sci., 38, 1989, pp. 195–237.

    Article  Google Scholar 

  4. R. Ladner, The computational complexity of provability in systems of modal propositional logic, SIAM J. Comput., 6, 1977, pp. 467–480.

    Article  Google Scholar 

  5. H. Ono and A. Nakamura, On the size of refutation Kripke models for some linear modal and tense logics, Studia Logica, 39, 1980, pp. 325–333.

    Article  Google Scholar 

  6. A. Sistla and E. Clarke, The complexity of propositional linear temporal logics, J. Assoc. Comput. Mach., 32, 1985, pp. 733–749.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands

    Edith Spaan

Authors
  1. Edith Spaan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Logic, Language and Computation, University of Amsterdam, The Netherlands

    Maarten de Rijke

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Spaan, E. (1993). The Complexity of Propositional Tense Logics. In: de Rijke, M. (eds) Diamonds and Defaults. Synthese Library, vol 229. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8242-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8242-1_10

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4286-6

  • Online ISBN: 978-94-015-8242-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation