Hybrid Ockhamist Temporal Logic

We introduce hybrid Ockhamist temporal logic, which combines the mechanisms of hybrid logic with Ockhamist semantics by employing nominals, satisfaction operators, binders, and quantifiers over branches. We provide a complete (with respect to bundled trees semantics) ax-iomatic system for the basic hybrid Ockhamist temporal logic (HOT) and for some of its extensions, including the full hybrid Ockhamist temporal logic. The full system is expressively equivalent to the first-order logic over trees ex-tended with branch quantifiers which was proved decidable by Gurevich and Shelah. 1