Similar Items: Proof complexity of positive branching programs
- Positive Hennessy-Milner Logic for Branching Bisimulation
- Pebble Games, Proof Complexity, and Time-Space Trade-offs
- On the relative proof complexity of deep inference via atomic flows
- A Finite-Model-Theoretic View on Propositional Proof Complexity
- Logic and Branching Automata
- Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics