Abstract
Primarily guided with the idea to express zero-time transitions by means of temporal propositional language, we have developed a temporal logic where the time flow is isomorphic to ordinal (concatenation of copies of ). If we think of as lexicographically ordered , then any particular zero-time transition can be represented by states whose indices are all elements of some . In order to express non-infinitesimal transitions, we have introduced a new unary temporal operator (-jump), whose effect on the time flow is the same as the effect of in . In terms of lexicographically ordered , is satisfied in -th time instant iff is satisfied in -th time instant. Moreover, in order to formally capture the natural semantics of the until operator , we have introduced a local variant of the until operator. More precisely, is satisfied in -th time instant iff is satisfied in -th time instant for some nonnegative integer , and is satisfied in -th time instant for all . As in many of our previous publications, the leitmotif is the usage of infinitary inference rules in order to achieve the strong completeness.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.