This is a preview. Log in through your library . Abstract A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are ...

We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multi-succedent calculus: ...

Computational complexity and proof systems are fundamental areas in theoretical computer science that explore the limits of what can be computed and how efficiently problems can be solved. Recent ...