Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory-Reference-Cited by-同舟云学术

Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory

Published:2019 Issue: Volume: Page:297-316
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

De Abhishek,Saurin Alexis

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-29026-9_17

Reference30 articles.

1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);D Baelde,2009

2. Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Computat. Logic (TOCL) 13(1), 2 (2012)

3. Baelde, D., Doumane, A., Kuperberg, D., Saurin, A.: Bouncing threads for infinitary and circular proofs. Manuscript, June 2019

4. Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, Marseille, France, 29 August–1 September 2016. LIPIcs, vol. 62, pp. 42:1–42:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)

5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);D Baelde,2007

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computational expressivity of (circular) proofs with fixed points;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Uniform Interpolation from Cyclic Proofs: The Case of Modal Mu-Calculus;Lecture Notes in Computer Science;2021

3. Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory;Lecture Notes in Computer Science;2019