Succinctness of cosafety fragments of LTL via combinatorial proof systems

DOI10.1007/978-3-031-57231-9_5MaRDI QIDQ6629519

Angelo Montanari, Luca Geatti, Alessio Mansutti

Publication date: 30 October 2024

zbMATH Keywords

proof systemssuccinctnesstemporal logicsLTL

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Cosmological lower bound on the circuit complexity of a small problem in logic
• Characterization of temporal property classes
• An n  ! lower bound on formula size
• The succinctness of first-order logic on linear orders
• Model checking of safety properties
• Scalable anytime algorithms for learning fragments of linear temporal logic
• On the number of quantifiers as a complexity measure

This page was built for publication: Succinctness of cosafety fragments of LTL via combinatorial proof systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629519)