Logics of time and computation
Logics of time and computation
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Topological reasoning and the logic of knowledge
TARK '92 Proceedings of the fourth conference on Theoretical aspects of reasoning about knowledge
Reasoning about knowledge
Temporal aspects of the modal logic of subset spaces
Theoretical Computer Science
Modal logic
Modal logics for continuous dynamics
Modal logics for continuous dynamics
Modelling Change with the Aid of Knowledge and Time
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
| Hi-index | 0.00 |
In the present paper we generalize two fundamental systems modelling the flow of time: the modal logic S4.3 and propositional linear time temporal logic. We allow to consider a whole set of states instead of only a single one at every time. Moreover, we assume that these sets increase in the course of time. Thus we get a basic formalism expressing a distinguished dynamic aspect of sets, growing. Our main results include completeness of the proposed axiomatizations and decidability of the set of all formally provable formulas.