Journal article
An axiomatization of full computation tree logic
Journal of Symbolic Logic, Vol.66(3), pp.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 logic.
Details
- Title
- An axiomatization of full computation tree logic
- Authors/Creators
- M. Reynolds (Author/Creator)
- Publication Details
- Journal of Symbolic Logic, Vol.66(3), pp.1011-1057
- Publisher
- Association for Symbolic Logic
- Identifiers
- 991005544858807891
- Copyright
- © Association for Symbolic Logic
- Murdoch Affiliation
- School of Information Technology
- Language
- English
- Resource Type
- Journal article
- Publisher URL
- http://www.aslonline.org/journals-journal.html
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites
Metrics
857 File views/ downloads
155 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Citation topics
- 3 Agriculture, Environment & Ecology
- 3.4 Crop Science
- 3.4.96 QTL
- Web Of Science research areas
- Biochemistry & Molecular Biology
- Chemistry, Multidisciplinary
- ESI research areas
- Chemistry