Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Extending Computational Tree Logic with Relations and Undefinedness

Lookup NU author(s): Dr Joey Coleman

Downloads

Licence

This is the final published version of a report that has been published in its final definitive form by Newcastle University, 2010.

For re-use rights please refer to the publisher's terms and conditions.

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

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2010

Pages: 13

Print publication date: 01/12/2010

Source Publication Date: December 2010

Report Number: 1230

Institution: Newcastle University

Place Published: Newcastle upon Tyne, UK

Share