Infinitary proof theory: the multiplicative additive case
From MaRDI portal
Recommendations
Cited in
(39)- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs
- Complete infinitary type logics
- Non-well-founded deduction for induction and coinduction
- Integrating induction and coinduction via closure operators and proof cycles
- Cyclic proofs, hypersequents, and transitive closure logic
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- Infinets: the parallel syntax for non-wellfounded proof-theory
- Cyclic arithmetic is equivalent to Peano arithmetic
- Substructural proofs as automata
- scientific article; zbMATH DE number 5000992 (Why is no real title available?)
- Proving infinitary formulas
- The consistency and complexity of multiplicative additive system virtual
- NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
- Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
- Local validity for circular proofs in linear logic with fixed points
- scientific article; zbMATH DE number 7559468 (Why is no real title available?)
- Circular proofs as session-typed processes: a local validity condition
- scientific article; zbMATH DE number 7155168 (Why is no real title available?)
- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points
- A logical account of subtyping for session types
- Abstract cyclic proofs
- Cyclic implicit complexity
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
- The exponential logic of sequentialization
- The Yoneda reduction of polymorphic types
- Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics
- Infinitary cut-elimination via finite approximations
- Computational expressivity of (circular) proofs with fixed points
- Fragments of arithmetic and cyclic proofs
- On the cut-elimination of the modal -calculus: linear logic to the rescue
- On the reverse mathematics of cut-elimination and determinacy
- Herbrand schemes for cyclic proofs
- Demystifying
- On structural proof theory of the modal logic \(\mathsf{K}^+\) extended with infinitary derivations
- A Curry-Howard correspondence for linear, reversible computation
- Comparing infinitary systems for linear logic with fixed points
- Failure of cut-elimination in cyclic-proof systems of logic of bunched implications with inductive propositions
- Cyclic implicit complexity
- Computation by infinite descent made explicit
This page was built for publication: Infinitary proof theory: the multiplicative additive case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278431)
