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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback