Similar Items: The Computational Complexity of Propositional Cirquent Calculus
- From formulas to cirquents in computability logic
- A Finite-Model-Theoretic View on Propositional Proof Complexity
- Classical propositional logic and decidability of variables in intuitionistic propositional logic
- A calculus for costed computations
- On Sub-Propositional Fragments of Modal Logic
- An Analytic Propositional Proof System on Graphs