A purely model-theoretic proof of the exponential succinctness gap between CTL^+ and CTL
From MaRDI portal
Publication:975478
Recommendations
- A finite-model-theoretic view on propositional proof complexity
- The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\)
- An asymptotically tight bound on countermodels for Łukasiewicz logic
- Some exponential lower bounds on formula-size in modal logic
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models
- On the gap between \(\mathit{ess}(f)\) and \(\mathit{cnf}_{-}\mathit{size}(f)\)
- A model theoretic proof of a subexponential time witnessing theorem
- On the absence of finite approximation relative to model completeness in propositional provability logic
- On the computability-theoretic complexity of trivial, strongly minimal models
- On absence of finite approximation relative to model completeness in the propositional provability logic
Cites work
Cited in
(3)
This page was built for publication: A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975478)