Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System-Reference-Cited by-同舟云学术

Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System

Published:2017 Issue: Volume: Page:301-317
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Berardi Stefano,Tatsuta Makoto

Publisher

Springer Berlin Heidelberg

Link

https://link.springer.com/content/pdf/10.1007/978-3-662-54458-7_18

Reference12 articles.

1. Berardi, S., Tatsuta, M.: The classic Martin-Löf’s system of inductive definitions is not equivalent to cyclic proofs (Full Paper), unpublished draft (2017)

2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);J Brotherston,2005

3. Brotherston, J.: Sequent calculus proof systems for inductive definitions, Ph.D. thesis, Laboratory for Foundations of Computer Science School of Informatics University of Edinburgh (2006)

4. Brotherston, J., Bornat, R., Calcagno, C.: Cyclic proofs of program termination in separation logic. In: Proceedings of POPL 2008 (2008)

5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);J Brotherston,2011

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

1. The Complex(ity) Landscape of Checking Infinite Descent;Proceedings of the ACM on Programming Languages;2024-01-05

2. Induction and Skolemization in saturation theorem proving;Annals of Pure and Applied Logic;2023-01

3. Cyclic proofs for the first-order µ-calculus;Logic Journal of the IGPL;2022-08-03

4. Cyclic proofs, system t, and the power of contraction;Proceedings of the ACM on Programming Languages;2021-01-04

5. Non-well-founded Deduction for Induction and Coinduction;Automated Deduction – CADE 28;2021