This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
BAKER K.A. Finite equational bases for finite algebras in a congruence distributive equational classes. Adv. Math., 1977, v.24, 207–243.
BREDIKHIN D.M. Representation of ordered involuted semigroups. Izvestija vuzov, matematika, 1975, No.7, 119–129 (in Russian).
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)
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.
GOLDBLATT R. Logic of time and computation. CSLI Lecture Notes No.7, 1987.
ISARD S. A finitely axiomatizable undecidable extension of K. Theoria, 1977, v.43, No.3, 195–202.
MATIJASEVICH Yu. V. Simple examples of undecidable associative calculi. Trudy MIAN SSSR, 1967, v.93, 50–88 (in Russian).
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.
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.
SEGERBERG K. Modal logics with linear alternative relations. Theoria, 1970, v.36, No.3, 301–322.
SHAIN B.M. Representation of ordered semigroups. Matematicheskij Sbornik, 1965, No.2, 188–197 (in Russian).
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).
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.
THOMASON S.K. Undecidability of the completeness problem of modal logic. Universal algebra and applications, 1982, v.9, 341–345. Banach Center Publications, Warsaw.
Author information
Authors and Affiliations
Editor information
Rights 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