Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1994: Computer Science Logic pp 442–455Cite as

Algorithmic aspects of propositional tense logics

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 933))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BAKER K.A. Finite equational bases for finite algebras in a congruence distributive equational classes. Adv. Math., 1977, v.24, 207–243.

    Google Scholar 

  2. BREDIKHIN D.M. Representation of ordered involuted semigroups. Izvestija vuzov, matematika, 1975, No.7, 119–129 (in Russian).

    Google Scholar 

  3. CHAGROV A.V. Undecidable properties of extensions of provability logic. I: Algebra i Logika, 1990, v.29, No.3, 350–367; II: ibid., No.5, 613–623. (In Russian)

    Google Scholar 

  4. CHAGROV A.V., ZAKHARYASCHEV M.V. The undecidability of the disjunction property of propositional logics and other related problems. J. of Symb. Logic, 1993, v.58, No.3, 967–1002.

    Google Scholar 

  5. GOLDBLATT R. Logic of time and computation. CSLI Lecture Notes No.7, 1987.

    Google Scholar 

  6. ISARD S. A finitely axiomatizable undecidable extension of K. Theoria, 1977, v.43, No.3, 195–202.

    Google Scholar 

  7. MATIJASEVICH Yu. V. Simple examples of undecidable associative calculi. Trudy MIAN SSSR, 1967, v.93, 50–88 (in Russian).

    Google Scholar 

  8. MINSKY M.L. Recursive unsolvability of Post's problem of “Tag” and other topics in the theory of Turing machines. Annals of Mathematics, 1961, v. 74, pp. 437–455.

    Google Scholar 

  9. SAHLQVIST H. Completeness and correspondence in the first and second order semantics for modal logic. Studies in Logic and Found. Math., 1975, v.82, 110–143.

    Google Scholar 

  10. SEGERBERG K. Modal logics with linear alternative relations. Theoria, 1970, v.36, No.3, 301–322.

    Google Scholar 

  11. SHAIN B.M. Representation of ordered semigroups. Matematicheskij Sbornik, 1965, No.2, 188–197 (in Russian).

    Google Scholar 

  12. SHEHTMAN V.B. Undecidable propositional calculi. In: Neklassicheskije logiki i ih prilozhenija. Ed. by All-Union Council on Cybernetics. Moscow,1982, 74–116 (In Russian).

    Google Scholar 

  13. THOMASON S.K. Reduction of tense logic to modal logic. I: J. of Symb. Logic, 1974, v.39, 549–551. II: Theoria, 1975, v. 41, 151–169.

    Google Scholar 

  14. THOMASON S.K. Undecidability of the completeness problem of modal logic. Universal algebra and applications, 1982, v.9, 341–345. Banach Center Publications, Warsaw.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tveŕ State University, Zhelyabova Str. 33, 170013, Tveŕ, Russia

    Alexander V. Chagrov & Valentin B. Shehtman

  2. Insitute for Problems of Information Transmission, Ermolovoj Str. 19, 101447, Moscow, Russia

    Alexander V. Chagrov & Valentin B. Shehtman

Authors
  1. Alexander V. Chagrov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valentin B. Shehtman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chagrov, A.V., Shehtman, V.B. (1995). Algorithmic aspects of propositional tense logics. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022274

Download citation

  • DOI: https://doi.org/10.1007/BFb0022274

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation