An Axiomatization of Full Computation Tree Logic

@article{Reynolds2001AnAO,
  title={An Axiomatization of Full Computation Tree Logic},
  author={Mark Reynolds},
  journal={J. Symb. Log.},
  year={2001},
  volume={66},
  pages={1011-1057}
}
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. ? 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…