Axiomatisation and decidability ofF andP in cyclical time |
| |
Authors: | Mark Reynolds |
| |
Affiliation: | (1) Department of Computing, Imperial College, 180 Queens Gate, SW7 2BZ London, UK |
| |
Abstract: | We present a Hilert style axiomatisation for the set of formulas in the temporal language withF andP which are valid over non-transitive cyclical flows of time.We also give a simpler axiomatisation using the slightly controversial irreflexivity rule and go on to prove the decidability of any temporal logic over cyclical time provided it uses only connectives with first-order tables. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|