Cited By
View all- Hewitt C(undefined)Computer Science Must Rely on Strongly-Typed Actors and Theories for CybersecuritySSRN Electronic Journal10.2139/ssrn.3418003
We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be constructive in some ...
Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a number of proof theoretic applications -- e.g. in game semantics, Ludics, and proof ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in