Pages that link to "Item:Q941433"

The following pages link to Cut-free sequent systems for temporal logic (Q941433):

Displaying 16 items.

• Completeness and decidability results for CTL in constructive type theory (Q287375) (← 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)
• Computer says no: verdict explainability for runtime monitors using a local proof system (Q1996872) (← links)
• Loop-check specification for a sequent calculus of temporal logic (Q2106881) (← links)
• Cyclic hypersequent calculi for some modal logics with the master modality (Q2142089) (← links)
• Loop-type sequent calculi for temporal logic (Q2228437) (← links)
• A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
• The Proof Theory of Common Knowledge (Q3299587) (← links)
• Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
• (Q5015285) (← 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 Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability (Q5191118) (← links)
• Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic (Q6067745) (← links)