Implicit and Explicit Definability in Modal and Temporal Logics
Part of the Synthese Library book series (SYLI, volume 247)
Interpolation and definability play an important part in the mathematical logic. We consider different versions of these properties. Let L be any propositional logic.
Unable to display preview. Download preview PDF.
- Beth, W.E.: 1953, “On Padoa’s method in the theory of definitions”, Indag. Math. Vol.15, no.4, pp. 330–339Google Scholar
- Gabbay, D.M.: 1972, “Craig’s interpolation theorem for modal logic”. Conference in Math. Logic, London’70, Berlin, Springer, pp. 111–127Google Scholar
- Gurevich, Y.: 1984, “Toward logic tailored for computational complexity”, Computation and proof theory. Lecture Notes in Math., 1104, Berlin, Springer, pp. 175–216Google Scholar
- Henkin, L., Monk, J.D., and Tarski, A.: 1985, Cylindric Algebras, Part II. North-Holland, AmsterdamGoogle Scholar
- Maksimova, L.L.: 1989a, “Interpolation in modal logics of infinite slice containing K4”, (in Russian). Matematiceskaya logika i algoritmiceskie problemy, Novosibirsk, Nauka (Sib. Div.), pp. 73–91Google Scholar
- Maksimova, L.L.: 1989c, “Interpolation, the Beth property and the tense logic of ‘tomorrow’” Preprint, Institute of Mathematics, Sib. Div. of Acad. Sei. of USSR, NovosibirskGoogle Scholar
- Maksimova, L.L.: 1990, “Temporal logics with discrete moments of time and the Beth property”, in: Proceedings of the 4th Asian Logical Conference, Sept. 1990, Tokyo, Japan, pp. 31–34Google Scholar
- Manna, Z. and Pnueli, A.: 1983, “Verification of concurrent programs: a temporal proof system”, in: Foundations of Computer Science TV (Math. Centre tracts), Amsterdam, pp. 163–255Google Scholar
© Springer Science+Business Media Dordrecht 1995