Author:
Berardi Stefano,Tatsuta Makoto
Publisher
Springer International Publishing
Reference21 articles.
1. Afshari, B., Leigh, G.: Cut-free completeness for modal mu-calculus. In: Proceedings of LICS 2017, pp. 1–12 (2017)
2. Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: Proceedings of 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). LIPIcs, vol. 62, pp. 42:1–42:17 (2016)
3. Berardi, S., Steila, S.: An intuitionistic version of Ramsey’s Theorem and its use in Program Termination. Ann. Pure Appl. Log. 166, 1382–1406 (2015)
4. Lecture Notes in Computer Science;S Berardi,2017
5. Berardi, S., Tatsuta, M.: Equivalence of inductive definitions and cyclic proofs under arithmetic. In: Proceedings of Thirty-Second Annual IEEE Symposium on Logic in Computer Science (LICS 2017), pp. 1–12 (2017)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polarized Subtyping;Programming Languages and Systems;2022