The following pages link to (Q4625692):
Displaying 11 items.
- A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL (Q975478) (← links)
- A simple combinatorial proof for the small model property of two-variable logic (Q2032164) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- On the convergence of reduction-based and model-based methods in proof theory (Q3644841) (← links)
- (Q4526735) (← links)
- (Q4539606) (← links)
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (Q4649532) (← links)
- (Q5091274) (← links)
- (Q5111195) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
