The following pages link to TTM (Q23931):
Displaying 15 items.
- Invariant-free clausal temporal resolution (Q352974) (← links)
- Cut-free sequent systems for temporal logic (Q941433) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- Dual systems of tableaux and sequents for PLTL (Q1035676) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
- Loop-type sequent calculi for temporal logic (Q2228437) (← links)
- Systematic semantic tableaux for PLTL (Q2871849) (← links)
- Generalized Qualitative Spatio-Temporal Reasoning: Complexity and Tableau Method (Q3455761) (← links)
- A Cut-Free and Invariant-Free Sequent Calculus for PLTL (Q3608433) (← links)
- (Q5015285) (← links)
- A derivation-loop method for temporal logic (Q5040806) (← links)
- More efficient proof-search for sequents of temporal logic (Q5058432) (← links)
- Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach (Q5079769) (← links)
- An axiomatization of ECTL (Q5406125) (← links)
