No. Title Author Year
1 HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete Fortin, Marie et al. 2021
2 FO = FO^3 for Linear Orders with Monotone Binary Relations Fortin, Marie 2019
3 Communicating Finite-State Machines and Two-Variable Logic Bollig, Benedikt et al. 2018
4 It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before" Bollig, Benedikt et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 4


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI