It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
Dynamic Topological Logic provides a context for studying the confluence of the topological semantics for S4, based on topological spaces rather than Kripke frames; topological dy...
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...