Cyclic Arithmetic Is Equivalent to Peano Arithmetic-Reference-Cited by-同舟云学术

Cyclic Arithmetic Is Equivalent to Peano Arithmetic

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

Author:

Simpson Alex

Publisher

Springer Berlin Heidelberg

Link

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

Reference25 articles.

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

2. Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: Talbot, J.-M., Regnier, L. (eds.) 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 62, pp. 42:1–42:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)

3. Berardi, S., Tatsuta, M.: Classical system of Martin-Löf’s inductive definitions is not equivalent to cyclic proof system. In: Esparza, J., Murawski, A.S. (Eds.) FOSSACS 2017. LNCS, vol. 10203, pp. 301–317. Springer, Heidelberg (2017)

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

5. Brotherston, J.: Sequent calculus proof systems for inductive definitions. Ph.D. thesis, University of Edinburgh, November 2006

Cited by 23 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. The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions;Journal of Logic and Computation;2023-12-07

5. Cyclic Hypersequent System for Transitive Closure Logic;Journal of Automated Reasoning;2023-08-16