scientific article; zbMATH DE number 2087442
From MaRDI portal
Publication:4738237
Recommendations
Cited in
(39)- On the proof theory of the modal mu-calculus
- Ambiguous classes in \(\mu\)-calculi hierarchies
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs
- Cut elimination for a logic with induction and co-induction
- Non-well-founded deduction for induction and coinduction
- Integrating induction and coinduction via closure operators and proof cycles
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- Circular (yet sound) proofs
- A coinductive approach to proof search through typed lambda-calculi
- From parity games to circular proofs
- Cyclic arithmetic is equivalent to Peano arithmetic
- A categorical setting for lower complexity
- Addressing Circular Definitions via Systems of Proofs
- Analytic calculi for circular concepts by finite revision
- Safe recursion revisited. I: Categorical semantics for lower complexity
- μ-Bicomplete Categories and Parity Games
- Foundations of regular coinduction
- Monotone recursive types and recursive data representations in Cedille
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
- Local validity for circular proofs in linear logic with fixed points
- Circular proofs as session-typed processes: a local validity condition
- The Recursion Scheme from the Cofree Recursive Comonad
- scientific article; zbMATH DE number 7155168 (Why is no real title available?)
- A duality between proof systems for cyclic term graphs
- Coinduction in Flow: The Later Modality in Fibrations
- Abstract cyclic proofs
- The variable hierarchy for the games -calculus
- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points
- Cyclic implicit complexity
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
- Fragments of arithmetic and cyclic proofs
- On the cut-elimination of the modal -calculus: linear logic to the rescue
- Herbrand schemes for cyclic proofs
- Totality for mixed inductive and coinductive types
- A Curry-Howard correspondence for linear, reversible computation
- Comparing infinitary systems for linear logic with fixed points
- Lifting star-autonomy
- Computation by infinite descent made explicit
- Canonical completeness of infinitary \(\mu \)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738237)
