Cyclic implicit complexity
From MaRDI portal
Publication:6649449
DOI10.1145/3531130.3533340MaRDI QIDQ6649449
Publication date: 6 December 2024
Complexity of computation (including implicit computational complexity) (03D15) Structure of proofs (03F07) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Games for the \(\mu\)-calculus
- A new recursion-theoretic characterization of the polytime functions
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Higher type recursion, ramification and polynomial time
- A cut-free cyclic proof system for Kleene algebra
- Infinets: the parallel syntax for non-wellfounded proof-theory
- PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic
- Sequent calculi for induction and infinite descent
- Characterizing PSPACE with pointers
- A Proof System for the Linear Time μ-Calculus
- Cyclic Proofs and Jumping Automata
- On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.
This page was built for publication: Cyclic implicit complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649449)
