Extending Computational Tree Logic with Relations and Undefinedness

  1. Lookup NU author(s)
  2. Dr Joey Coleman
Author(s)Coleman JW
Publication type Report
Series TitleSchool of Computing Science Technical Report Series
Year2010
Legacy DateDecember 2010
Report Number1230
Pages13
Full text is available for this publication:
This paper describes three extensions to computational tree logic: one which uses relational atomic propositions; one which can handle undefined terms; and, last, the direct combination of the first two extensions.
InstitutionNewcastle University
Place PublishedNewcastle upon Tyne, UK
ActionsLink to this publication