From action to next and then to always (semantical analysis)

HKUST Electronic Theses

From action to next and then to always (semantical analysis)

by Chung Kei Wong

THESIS 1993

M.Phil. Computer science

vi, 44 leaves ; 30 cm

Abstract
We show that Temporal Logic of Actions (TLA) can be embedded into First-Order Temporal Logic (FTL), and FTL can also be embedded into Temporal Logic without Next (MLl). Through these embeddings, we know that for a first order temporal logic, we do not need actions and the [circle] (Next) operator when we consider the valid formulas. That is, the [square box] (Always) operator is the only temporal operator required.

View Copyrighted to the author. Reproduction is prohibited without the author’s prior written consent.

Details

Collection HKUST Electronic Theses Degree M.Phil. Department Computer science Authors Wong, Chung Kei Subjects Computer programming Logic, Symbolic and mathematical Language English Call number Thesis COMP 1993 Wong DOI 10.14711/thesis-b433367

Full record

From action to next and then to always (semantical analysis)

by Chung Kei Wong

Post a Comment Cancel reply