The following pages link to Computer Science Logic (Q5311264):
Displaying 18 items.
- Temporal BI: proof system, semantics and translations (Q391122) (← links)
- Internal axioms for domain semirings (Q627202) (← links)
- Assumption/guarantee specifications in linear-time temporal logic (Q671674) (← links)
- Constructive linear-time temporal logic: proof systems and Kripke semantics (Q764262) (← links)
- Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) (← links)
- Combining linear-time temporal logic with constructiveness and paraconsistency (Q975875) (← links)
- From liveness to promptness (Q1039845) (← links)
- LTL is closed under topological closure (Q2448112) (← links)
- Liveness checking as safety checking for infinite state spaces (Q2852018) (← links)
- A lattice-theoretic characterization of safety and liveness (Q2943770) (← links)
- Modal Semirings Revisited (Q3521996) (← links)
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (Q3602799) (← links)
- (Q4037387) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations (Q5169969) (← links)
- Exploring the Jungle of Intuitionistic Temporal Logics (Q6063858) (← links)
- Refining the Safety-Liveness Classification of Temporal Properties According to Realizability (Q6488336) (← links)
- Ill-founded proof systems for intuitionistic linear-time temporal logic (Q6541154) (← links)