- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
An axiomatization of full computation tree logic
Journal of Symbolic Logic 66 (3):1011-1057 (2001)
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 logicOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
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 (#67,753)
6 months
9 (#328,796)
2009-01-28
Downloads
446 (#67,753)
6 months
9 (#328,796)
Historical graph of 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.
Information dynamics and uniform substitution.Wesley H. Holliday, Tomohiro Hoshi & Thomas F. Icard Iii - 2013 - Synthese 190 (1):31-55.
A Propositional Dynamic Logic for Instantial Neighborhood Semantics.Johan van Benthem, Nick Bezhanishvili & Sebastian Enqvist - 2019 - Studia Logica 107 (4):719-751.
Deontic action logic, atomic boolean algebras and fault-tolerance.Pablo F. Castro & T. S. E. Maibaum - 2009 - Journal of Applied Logic 7 (4):441-466.
Completeness of a Branching-Time Logic with Possible Choices.Roberto Ciuni & Alberto Zanardo - 2010 - Studia Logica 96 (3):393-420.
References found in this work
A finite axiomatization of the set of strongly valid ockhamist formulas.Alberto Zanardo - 1985 - Journal of Philosophical Logic 14 (4):447 - 468.
Non-definability of the class of complete bundled trees.A. Zanardo, B. Barcellan & M. Reynolds - 1999 - Logic Journal of the IGPL 7 (1):125-136.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-8567d8d854-7fk9p dc2