The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Logics of time and computation
Logics of time and computation
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Alternating the Temporal Picture for Safety
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
Admissible Rules of Modal Logics
Journal of Logic and Computation
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
Journal of Logic and Computation
Undecidability of the unification and admissibility problems for modal and description logics
ACM Transactions on Computational Logic (TOCL)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Journal of Logic and Computation
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Linear temporal logic with until and before on integer numbers, deciding algorithms
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 5.23 |
The paper develops a technique for computation inference rules admissible in temporal logic T"S"4. The problem whether there exists an algorithm recognizing inference rules admissible in T"S"4 is a long-standing open problem. The logic T"S"4 has neither the extension property nor the co-cover property which previously were central instruments for construction decision algorithms for admissibility in modal logics (e.g. reflexive and transitive modal logic S4). Our paper uses a linear-compression property, a zigzag-ray property and a zigzag stretching property which hold for T"S"4. The main result of the paper is a sufficient condition for admissibility inference rules in T"S"4. It is shown that all rules which are valid in special finite models (with an effective upper bound on size) must be admissible in T"S"4.