Computational expressivity of (circular) proofs with fixed points
From MaRDI portal
Cited in
(8)- Computational expressivity of (circular) proofs with fixed points
- Intuitionistic -calculus with the Lewis arrow
- Fragments of arithmetic and cyclic proofs
- Herbrand schemes for first-order logic
- Peano arithmetic and MALL
- Computation by infinite descent made explicit
- Unravelling cyclic first-order arithmetic
- Cyclic proof theory of generalised inductive definitions
This page was built for publication: Computational expressivity of (circular) proofs with fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851673)