Other papers
online
An Axiomatization of Full Computation Tree Logic
Mark
Reynolds
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.
Full Paper
Postscript
draft version (double spaced) 17/7/00
Status
Apppeared as:
M. Reynolds. An axiomatization of full computation tree logic.
Journal of Symbolic Logic, 66(3):1011--1057, Sept. 2001.
Bibtex
@article{Rey:ctlstar,
author="M. Reynolds",
title="An Axiomatization of Full Computation Tree Logic",
journal="Journal of Symbolic Logic",
volume="66";
number=3;
pages="1011--1057",
year="2002",
}