Cited By
View all- Das ADe A(2024)A Proof Theory of ($$\omega $$-)Context-Free Languages, via Non-wellfounded ProofsAutomated Reasoning10.1007/978-3-031-63501-4_13(237-256)Online publication date: 2-Jul-2024
Cyclic Implicit Complexity
Article No.: 19, Pages 1 - 13
Abstract
Circular (or cyclic) proofs have received increasing attention in recent years, and have been proposed as an alternative setting for studying (co)inductive reasoning. In particular, now several type systems based on circular reasoning have been proposed. However, little is known about the complexity theoretic aspects of circular proofs, which exhibit sophisticated loop structures atypical of more common ‘recursion schemes’.
This paper attempts to bridge the gap between circular proofs and implicit computational complexity (ICC). Namely we introduce a circular proof system based on Bellantoni and Cook’s famous safe-normal function algebra, and we identify proof theoretical constraints, inspired by ICC, to characterise the polynomial-time and elementary computable functions. Along the way we introduce new recursion theoretic implicit characterisations of these classes that may be of interest in their own right.
References
[1]
David Baelde, Amina Doumane, Denis Kuperberg, and Alexis Saurin. 2020. Bouncing threads for infinitary and circular proofs. CoRR abs/2005.08257(2020). arXiv:2005.08257https://arxiv.org/abs/2005.08257
[2]
David Baelde, Amina Doumane, and Alexis Saurin. 2016. Infinitary Proof Theory: the Multiplicative Additive Case. 62 (2016), 42:1–42:17. https://doi.org/10.4230/LIPIcs.CSL.2016.42
[3]
Stephen Bellantoni. 1992. Predicative recursion and computational complexity. PhD thesis.
[4]
Stephen Bellantoni. 1995. Predicative Recursion and The Polytime Hierarchy. In Feasible Mathematics II, Peter Clote and Jeffrey B. Remmel (Eds.). Birkhäuser Boston, Boston, MA, 15–29.
[5]
Stephen Bellantoni and Stephen Cook. 1992. A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract). In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (Victoria, British Columbia, Canada) (STOC ’92). Association for Computing Machinery, New York, NY, USA, 283–293. https://doi.org/10.1145/129712.129740
[6]
Stephen J. Bellantoni, Karl-Heinz Niggl, and Helmut Schwichtenberg. 2000. Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. 104, 1-3 (2000), 17–30. https://doi.org/10.1016/S0168-0072(00)00006-3
[7]
Stefano Berardi and Makoto Tatsuta. 2017. Equivalence of inductive definitions and cyclic proofs under arithmetic. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017. IEEE Computer Society, 1–12. https://doi.org/10.1109/LICS.2017.8005114
[8]
James Brotherston and Alex Simpson. 2011. Sequent calculi for induction and infinite descent. Journal of Logic and Computation 21, 6 (2011), 1177–1216.
[9]
Gianluca Curzi and Anupam Das. 2021. Cyclic Implicit Complexity. CoRR abs/2110.01114(2021). arXiv:2110.01114https://arxiv.org/abs/2110.01114
[10]
Anupam Das. 2020. A circular version of Gödel’s T and its abstraction complexity. CoRR abs/2012.14421(2020). arXiv:2012.14421https://arxiv.org/abs/2012.14421
[11]
Anupam Das. 2020. On the logical complexity of cyclic arithmetic. Log. Methods Comput. Sci. 16, 1 (2020). https://doi.org/10.23638/LMCS-16(1:1)2020
[12]
Anupam Das. 2021. On the Logical Strength of Confluence and Normalisation for Cyclic Proofs. In 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, July 17-24, 2021, Buenos Aires, Argentina (Virtual Conference)(LIPIcs, Vol. 195), Naoki Kobayashi (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 29:1–29:23. https://doi.org/10.4230/LIPIcs.FSCD.2021.29
[13]
Anupam Das and Damien Pous. 2017. A cut-free cyclic proof system for Kleene algebra. In International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. Springer, 261–277.
[14]
Anupam Das and Damien Pous. 2018. Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 119), Dan Ghica and Achim Jung (Eds.). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 19:1–19:18. https://doi.org/10.4230/LIPIcs.CSL.2018.19
[15]
Christian Dax, Martin Hofmann, and Martin Lange. 2006. A Proof System for the Linear Time μ-Calculus. In FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings(Lecture Notes in Computer Science, Vol. 4337), S. Arun-Kumar and Naveen Garg (Eds.). Springer, 273–284. https://doi.org/10.1007/11944836_26
[16]
Christian Dax, Martin Hofmann, and Martin Lange. 2006. A proof system for the linear time μ-calculus. In International Conference on Foundations of Software Technology and Theoretical Computer Science. Springer, 273–284.
[17]
Abhishek De and Alexis Saurin. 2019. Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. In Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings(Lecture Notes in Computer Science, Vol. 11714), Serenella Cerrito and Andrei Popescu (Eds.). Springer, 297–316. https://doi.org/10.1007/978-3-030-29026-9_17
[18]
Jérôme Fortier and Luigi Santocanale. 2013. Cuts for circular proofs: semantics and cut-elimination. In Computer Science Logic 2013 (CSL 2013). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[19]
Martin Hofmann. 1997. A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. In Computer Science Logic, 11th International Workshop, CSL ’97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers(Lecture Notes in Computer Science, Vol. 1414), Mogens Nielsen and Wolfgang Thomas (Eds.). Springer, 275–294. https://doi.org/10.1007/BFb0028020
[20]
Stephen Cole Kleene. 1971. Introduction to Metamathematics(7 ed.). Wolters-Noordhoff Publishing.
[21]
Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, and Michal Skrzypczak. 2019. The logical strength of Büchi’s decidability theorem. Log. Methods Comput. Sci. 15, 2 (2019). https://doi.org/10.23638/LMCS-15(2:16)2019
[22]
Denis Kuperberg, Laureline Pinault, and Damien Pous. 2021. Cyclic proofs, system t, and the power of contraction. Proc. ACM Program. Lang. 5, POPL (2021), 1–28. https://doi.org/10.1145/3434282
[23]
Daniel Leivant. 1991. A Foundational Delineation of Computational Feasiblity. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS ’91), Amsterdam, The Netherlands, July 15-18, 1991. IEEE Computer Society, 2–11. https://doi.org/10.1109/LICS.1991.151625
[24]
Daniel Leivant. 1999. Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity. Ann. Pure Appl. Log. 96, 1-3 (1999), 209–229. https://doi.org/10.1016/S0168-0072(98)00040-2
[25]
Daniel Leivant and Jean-Yves Marion. 1994. Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. In Computer Science Logic, 8th International Workshop, CSL ’94, Kazimierz, Poland, September 25-30, 1994, Selected Papers(Lecture Notes in Computer Science, Vol. 933), Leszek Pacholski and Jerzy Tiuryn (Eds.). Springer, 486–500. https://doi.org/10.1007/BFb0022277
[26]
Grigori E Mints. 1978. Finite investigations of transfinite derivations. Journal of Soviet Mathematics 10, 4 (1978), 548–596.
[27]
Damian Niwiński and Igor Walukiewicz. 1996. Games for the μ-calculus. Theoretical Computer Science 163, 1-2 (1996), 99–116.
[28]
Rémi Nollet, Alexis Saurin, and Christine Tasson. 2019. PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points. In Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings(Lecture Notes in Computer Science, Vol. 11714), Serenella Cerrito and Andrei Popescu (Eds.). Springer, 317–334. https://doi.org/10.1007/978-3-030-29026-9_18
[29]
Isabel Oitavem. 2008. Characterizing PSPACE with pointers. Math. Log. Q. 54, 3 (2008), 323–329. https://doi.org/10.1002/malq.200610056
[30]
Alex Simpson. 2017. Cyclic Arithmetic Is Equivalent to Peano Arithmetic. In Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings(Lecture Notes in Computer Science, Vol. 10203), Javier Esparza and Andrzej S. Murawski (Eds.). 283–300. https://doi.org/10.1007/978-3-662-54458-7_17
[31]
Marc Wirz. 1999. Characterizing the Grzegorczyk hierarchy by safe recursion.
Recommendations
Cyclic Hypersequent Calculi for Some Modal Logics with the Master Modality
Automated Reasoning with Analytic Tableaux and Related MethodsAbstractAt LICS 2013, O. Lahav introduced a technique to uniformly construct cut-free hypersequent calculi for basic modal logics characterised by frames satisfying so-called ‘simple’ first-order conditions. We investigate the generalisation of this ...
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub, and S. Smale. We show that the levels of the polynomial hierarchy correspond to safe ...
Cyclic Hypersequent System for Transitive Closure Logic
AbstractWe propose a cut-free cyclic system for transitive closure logic (TCL) based on a form of hypersequents, suitable for automated reasoning via proof search. We show that previously proposed sequent systems are cut-free incomplete for basic ...
Comments
Information & Contributors
Information
Published In
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 August 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
LICS '22
Sponsor:
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science
August 2 - 5, 2022
Haifa, Israel
Acceptance Rates
Overall Acceptance Rate 215 of 622 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 78Total Downloads
- Downloads (Last 12 months)29
- Downloads (Last 6 weeks)2
Reflects downloads up to 25 Jan 2025
Other Metrics
Citations
Cited By
View all- Das ADe A(2024)A Proof Theory of ($$\omega $$-)Context-Free Languages, via Non-wellfounded ProofsAutomated Reasoning10.1007/978-3-031-63501-4_13(237-256)Online publication date: 2-Jul-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format