An axiomatization of full computation tree logic

Journal of Symbolic Logic 66 (3):1011-1057 (2001)
  Copy   BIBTEX

Abstract

We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic

Categories

Keywords

Reprint years

DOI

10.2307/2695091

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,566

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):221-242.
Extended full computation-tree logics for paraconsistent model checking.Norihiro Kamide - 2007 - Logic and Logical Philosophy 15 (3):251-276.
Axiomatization of a Branching Time Logic with Indistinguishability Relations.Alberto Gatto - 2016 - Journal of Philosophical Logic 45 (2):155-182.
Church's problem revisited.Orna Kupferman & Moshe Y. Vardi - 1999 - Bulletin of Symbolic Logic 5 (2):245-263.
A sound and complete axiomatization for Dynamic Topological Logic.David Fernández-Duque - 2012 - Journal of Symbolic Logic 77 (3):947-969.
Propositional temporal logics: decidability and completeness.O. Lichtenstein & A. Pneuli - 2000 - Logic Journal of the IGPL 8 (1):55-85.

Analytics

Added to PP
2009-01-28

Downloads
446 (#68,459)

6 months
8 (#469,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.

View all 17 citations / Add more citations

References found in this work

Decidability for branching time.John P. Burgess - 1980 - Studia Logica 39 (2-3):203-218.
A finite axiomatization of the set of strongly valid ockhamist formulas.Alberto Zanardo - 1985 - Journal of Philosophical Logic 14 (4):447 - 468.

Add more references