Algorithmic aspects of propositional tense logics

  • Alexander V. Chagrov
  • Valentin B. Shehtman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 933)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [2]
    BREDIKHIN D.M. Representation of ordered involuted semigroups. Izvestija vuzov, matematika, 1975, No.7, 119–129 (in Russian).Google Scholar
  3. [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. [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. [5]
    GOLDBLATT R. Logic of time and computation. CSLI Lecture Notes No.7, 1987.Google Scholar
  6. [6]
    ISARD S. A finitely axiomatizable undecidable extension of K. Theoria, 1977, v.43, No.3, 195–202.Google Scholar
  7. [7]
    MATIJASEVICH Yu. V. Simple examples of undecidable associative calculi. Trudy MIAN SSSR, 1967, v.93, 50–88 (in Russian).Google Scholar
  8. [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. [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. [10]
    SEGERBERG K. Modal logics with linear alternative relations. Theoria, 1970, v.36, No.3, 301–322.Google Scholar
  11. [11]
    SHAIN B.M. Representation of ordered semigroups. Matematicheskij Sbornik, 1965, No.2, 188–197 (in Russian).Google Scholar
  12. [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. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Alexander V. Chagrov
    • 1
    • 2
  • Valentin B. Shehtman
    • 1
    • 2
  1. 1.Tveŕ State UniversityTveŕRussia
  2. 2.Insitute for Problems of Information TransmissionMoscowRussia

Personalised recommendations