Skip to main content Accessibility help

Branching-time logic with quantification over branches: The point of view of modal logic

  • Alberto Zanardo (a1)

In Ockhamist branching-time logic [Prior 67], formulas are meant to be evaluated on a specified branch, or history, passing through the moment at hand. The linguistic counterpart of the manifoldness of future is a possibility operator which is read as ‘at some branch, or history (passing through the moment at hand)’. Both the bundled-trees semantics [Burgess 79] and the 〈moment, history〉 semantics [Thomason 84] for the possibility operator involve a quantification over sets of moments. The Ockhamist frames are (3-modal) Kripke structures in which this second-order quantification is represented by a first-order quantification. The aim of the present paper is to investigate the notions of modal definability, validity, and axiomatizability concerning 3-modal frames which can be viewed as generalizations of Ockhamist frames.

Hide All
[Bell & Machover 77]Bell, J. and Machover, M., A course in mathematical logic, North-Holland, Amsterdam, 1977.
[Belnap 92]Belnap, N., Branching space-time, Synthese, vol. 92 (1992), pp. 385434.
[Belnap & Green 94]Belnap, N. and Green, M., Indeterminism and the red thin line, Philosophical Perspectives, Vol. 8: Logic and Language (1994), pp. 365388.
[Belnap & Perloff 90]Belnap, N. and Perloff, M., Seeing to it that: a canonical form of agentives, Knowledge representation and defeasible reasonings (Kyburg, H. E. Jr., Loui, R. P., and Carlson, G. N., editors), Kluwer Academic Publisher, 1990, pp. 175199.
[van Benthem 83]van Benthem, J., The logic of time, Reidel, Dordrecht, 1983.
[van Benthem 85]van Benthem, J., Modal logic and classical logic, Bibliopolis, Napoli, 1985.
[van Benthem 92]van Benthem, J., Temporal logic, Handbook of logic in artificial intelligence and logic programming Vol. III (Gabbay, D., editor), Oxford University Press, Oxford, 1992.
[van Benthem 94]van Benthem, J., Logic as programming, Fundamenta Informaticae, vol. 17 (1994), pp. 285317.
[Burgess 79]Burgess, J., Logic and time, this Journal, vol. 44 (1979), pp. 556582.
[Burgess 80]Burgess, J., Decidability for branching time, Studia Logica, vol. 39 (1980), pp. 203218.
[Burgess 82]Burgess, J., Axioms for tense logic I. “Since” and “Until”, Notre Dame Journal of Formal Logic, vol. 23 (1982), pp. 367374.
[Chang & Keisler 90]Chang, C. and Keisler, J., Model theory, (3rd ed.), North-Holland, Amsterdam, 1990.
[Chellas 92]Chellas, B., Time and modality in the logic of agency, Studia Logica, vol. 51 (1992), pp. 485517.
[Clarke & Emerson 81]Clarke, E. and Emerson, E., Design and synthesis of synchronization skeletons using branching time temporal logic, Proceedings of the Workshop on Logics of Programs (Kozen, D., editor), Lecture Notes in Computer Science, vol. 131, Springer-Verlag, 1981, pp. 5271.
[Di Maio & Zanardo 94]Maio, M. C. Di and Zanardo, A., Synchronized histories in Prior-Thomason representation of branching time, Proceedings of the First International Conference on Temporal Logic (Gabbay, D. and Ohlbach, H., editors), Springer-Verlag, 1994, pp. 265282.
[Emerson 83]Emerson, E., Alternative semantics for temporal logics, Theoretical Computer Science, vol. 26 (1983), pp. 120130.
[Gabbay 81]Gabbay, D., An irreflexivity lemma with applications to axiomatizations of conditions on tense frames, Aspects of Philosophical Logic (Mönnich, U., editor), Reidel, Dordrecht, 1981, pp. 6789.
[Gabbay et al. 94]Gabbay, D., Hodkinson, I., and Reynolds, M., Temporal logic: Mathematical foundation and computational aspects Vol. I, Oxford University Press, Oxford, 1994.
[Gurevich & Shelah 85]Gurevich, Y. and Shelah, S., The decision problem for branching time logic, this Journal, vol. 50 (1985), pp. 668681.
[Kamp 68]Kamp, J., Tense logic and the theory of linear order, Ph.D. dissertation, University of California at Los Angeles, 1968.
[Kamp 71]Kamp, J., Formal properties of ‘now’, Theoria, vol. 37 (1971), pp. 227273.
[von Kutschera 93]von Kutschera, F., Causation, Journal of Philosophical Logic, vol. 22 (1993), pp. 563588.
[Henkin 50]Henkin, L., Completeness in the theory of types, this Journal, vol. 15 (1950), pp. 8191.
[Prior 67]Prior, A., Past, present and future, Clarendon, Oxford, 1967.
[Sahlqvist 75]Sahlqvist, H., Completeness and correspondence and the first and second order semantics for modal logic, Proceedings of the third Scandinavian logic symposium (Kanger, S., editor), North-Holland, Amsterdam, pp. 110143.
[Sambin & Vaccaro 89]Sambin, G. and Vaccaro, V., A new proof of Sahlqvist's theorem on modal definability and completeness, this Journal, vol. 54 (1989), pp. 992999.
[Segerberg 70]Segerberg, K., Modal logics with linear alternative relations, Theoria, vol. 36 (1970), pp. 301322.
[Stirling 91]Stirling, C., Modal and temporal logics, Handbook of Logic in Computer Science (Abramsky, S.Gabbay, D. and Maibaum, T., editors), Oxford University Press, Oxford, 1991.
[Thomason 84]Thomason, R., Combinations of tense and modality, The Handbook of Philosophical Logic, vol. 2 (Gabbay, D. and Guenthner, F., editors), Reidel, Dordrecht, 1984, pp. 135165.
[Venema 93]Venema, Y., Derivation Rules as anti-axioms in modal logic, this Journal, vol. 58 (3) (1993), pp. 10031034.
[Xu 88]Xu, M., On some US-tense logics, Journal of Philosophical Logic, vol. 17 (1988), pp. 181202.
[Zanardo 85]Zanardo, A., A finite axiomatization of the set of strongly valid Ockhamist formulas, Journal of Philosophical Logic, vol. 14 (1985), pp. 447468.
[Zanardo 86]Zanardo, A., On the charactezizability of the frames for the unpreventability of the present and the past, Notre Dame Journal of Formal Logic, vol. 27 (1986), pp. 556564.
[Zanardo 90]Zanardo, A., Axiomatization of ‘Peircean’ branching-time logic, Studia Logica, vol. 49 (1990), pp. 183195.
[Zanardo 91 ]Zanardo, A., A complete deductive system for Since- Until branching-time logic, Journal of Philosophical Logic, vol. 20 (1991), pp. 131148.
[Zanardo & Carmo 93]Zanardo, A. and Carmo, J., Ockhamist computational logic: Past-sensitive necessitation in CTL*, Journal of Logic and Computation, vol. 3 (1993), pp. 249268.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed