Author:
Afshari Bahareh,Wehr Dominik
Publisher
Springer International Publishing
Reference22 articles.
1. Afshari, B., Leigh, G.E.: Cut-free completeness for modal mu-calculus. In: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–12, June 2017. https://doi.org/10.1109/LICS.2017.8005088
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);B Afshari,2021
3. Baelde, D., Doumane, A., Kuperberg, D., Saurin, A.: Bouncing threads for infinitary and circular proofs. arXiv:2005.08257 [cs], May 2020
4. Berardi, S., Tatsuta, M.: Equivalence of inductive definitions and cyclic proofs under arithmetic. In: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–12 (2017). https://doi.org/10.1109/LICS.2017.8005114
5. Brotherston, J.: Sequent calculus proof systems for inductive definitions. Ph.D. thesis, University of Edinburgh, November 2006
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. From GTC to : Generating reset proof systems from cyclic proof systems;Annals of Pure and Applied Logic;2024-12
2. Abstract cyclic proofs;Mathematical Structures in Computer Science;2024-04-19
3. The Complex(ity) Landscape of Checking Infinite Descent;Proceedings of the ACM on Programming Languages;2024-01-05
4. A Cyclic Proof System for Guarded Kleene Algebra with Tests;Lecture Notes in Computer Science;2024