Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T18:24:01.331Z Has data issue: false hasContentIssue false

An axiomatization of full Computation Tree Logic

Published online by Cambridge University Press:  12 March 2014

M. Reynolds*
Affiliation:
School of Information Technology, Murdoch University, South Street, Perth, Western Australia 6150, E-mail: m.reynolds@murdoch.edu.au

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable