Author:
Castellan Simon,Yoshida Nobuko
Publisher
Springer International Publishing
Reference28 articles.
1. Abramsky, S., Melliés, P.-A.: Concurrent games and full completeness. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, 2–5 July 1999, pp. 431–442 (1999).
http://dx.doi.org/10.1109/LICS.1999.782638
2. Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: CSL. Leibniz International Proceedings in Informatics (LIPIcs), vol. 62, pp. 42:1–42:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)
3. Lecture Notes in Computer Science;M Bagnol,2015
4. Blute, R., Hamano, M., Scott, P.J.: Softness of hypercoherences and MALL full completeness. Ann. Pure Appl. Logic 131(1–3), 1–63 (2005).
https://doi.org/10.1016/j.apal.2004.05.002
5. Lecture Notes in Computer Science;L Caires,2010
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献