Extending Computational Tree Logic with Relations and Underfinedness

摘要

This paper describes three extensions to computational thee logics: one which uses relational atomic propositions; one which can handle undefined terms; and last, the direct combination of the first two extensions.