Girard introduced phase semantics as a complete set-theoretic semantics of linear logic, and Okada modified phase-semantic completeness proofs to obtain normalform theorems. On the basis of these ...

We give a new proof of the following result (originally due to Linial and Post): it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of ...

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 ...