Similar Items: A Finite-Model-Theoretic View on Propositional Proof Complexity
- An Analytic Propositional Proof System on Graphs
- The Completeness of Propositional Resolution: A Simple and Constructive Proof
- A duality theoretic view on limits of finite structures: Extended version
- Reduction Free Normalisation for a proof irrelevant type of propositions
- The Computational Complexity of Propositional Cirquent Calculus
- Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality