Toggle Main Menu Toggle Search

ePrints

Extending Computational Tree Logic with Relations and Undefinedness

Lookup NU author(s): Dr Joey Coleman

Downloads


Abstract

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.


Publication metadata

Author(s): Coleman JW

Publication type: Report

Series Title: School of Computing Science Technical Report Series

Year: 2010

Pages: 13

Source Publication Date: December 2010

Report Number: 1230

Institution: Newcastle University

Place Published: Newcastle upon Tyne, UK


Share