Abstract
We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: “point of reference-reference pointer” which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's and Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions.
Similar content being viewed by others
References
vanBenthemJ.F.A.K., 1983, The Logic of Time, Dordrecht: Reidel.
Blackburn P., 1989, Nominal Tense Logic, Dissertation, Centre for Cognitive Science, University of Edinburgh.
BullR., 1970, “An approach to tense logic,” Theoria 36(3), 282–300.
BurgessJ., 1982, “Axioms for tense logic I: “since” and “until”,” Notre Dame Journal of Formal Logic 23(2), 367–374.
BurgessJ., 1984, “Basic tense logic,” pp. 89–133 in: Handbook of Philosophical Logic, D.Gabbay and F.Guenthner, eds., Vol. II, Dordrecht: Reidel.
GabbayD., 1981a, “An irreflexivity lemma with applications to axiomatizations of conditions on tense frames. pp. 67–89 in: Aspects of Philosophical Logic, U.Monnich, ed., Dordrecht: Reidel.
GabbayD., 1981b, “Expressive functional completeness in tense logic,” pp. 91–117, in: Aspects of Philosophical Logic, U.Monnich, ed., Dordrecht: Reidel.
GabbayD. and HodkinsonI., 1990, “An axiomatization of the temporal logic with since and until over the real numbers,” Journal of Logic and Computation 1, 229–259.
GargovG. and GorankoV., 1993, “Modal logic with names,” Journal of Philosophical Logic 22(6), 607–636.
GoldblattR.I., 1982, Axiomatizing the Logic of Computer Programming, LNCS Vol. 30, Berlin: Springer.
Goldblatt, R.I., 1987, Logic of Time and Computation, CSLI Lecture Notes, No. 7.
HarelD., 1983, “Recurring dominoes,” pp. 177–194 in: Foundations of Computing Theory, LNCS Vol. 158, Berlin: Springer.
KampJ.A.W., 1971, “Formal properties of “now”,” Theoria 37, 227–273.
PriorA., 1967, Past, Present, and Future, Oxford: Clarendon Press.
PassyS. and TinchevT., 1985, “Quantifiers in combinatory PDL: Completeness, definability, incompleteness,” pp. 512–519 in: Proc. Fundamentals of Computation Theory, L.Budach, ed., LNCS Vol. 199, Berlin: Springer.
PassyS. and TinchevT., 1991, “An essay in combinatory dynamic logic,” Information and Computation 93(2), 263–332.
RichardsB., BethkeI., van derDoesJ., and OberlanderJ., 1989, Temporal Representation and Inference, London: Academic Press.
deRijkeM., 1992, “The modal theory of inequality,” Journal of Symbolic Logic 57(2), 566–584.
de Rijke, M., 1993, Extending Modal Logic, ILLC Dissertation Series 1993-4, Amsterdam.
VenemaY., 1993, “Derivation rules as anti-axioms in modal logic,” Journal of Symbolic Logic 58(3), 1003–1034.
Vlach, F., Now and Then: A Formal Study in the Logic of Tense Anaphora, Dissertation, UCLA, 1973.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Goranko, V. Hierarchies of modal and temporal logics with reference pointers. J Logic Lang Inf 5, 1–24 (1996). https://doi.org/10.1007/BF00215625
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00215625