Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference36 articles.
1. Games and full completeness for multiplicative linear logic;Abramsky;Journal of Symbolic Logic,1994
2. An arithmetic for non-size-increasing polynomial-time computation;Aehlig;Theoretical Computer Science,2004
3. A new “feasible” arithmetic;Bellantoni;Journal of Symbolic Logic,2002
4. Degrees of indeterminacy of games;Blass;Fundamenta Mathematicae,1972
5. A game semantics for linear logic;Blass;Annals of Pure and Applied Logic,1992
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献