This is a preview. Log in through your library . Abstract We conducted a computer-based psychological experiment in which a random mix of 40 tautologies and 40 non-tautologies were presented to the ...

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

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