Infinets: the parallel syntax for non-wellfounded proof-theory

DOI10.1007/978-3-030-29026-9_17MaRDI QIDQ2180524zbMATH OpenOpenAlexFDO

Authors Abhishek De, Alexis Saurin

Publication date 14 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-29026-9_17

zbMATH Keywords

\(\mu\)-calculuscircular proofsfixed pointsinduction and coinductionlinear logicnon-wellfounded proofsproof-nets

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Infinitary proof theory: the multiplicative additive case
• scientific article; zbMATH DE number 1956528
• On the proof theory of the modal mu-calculus
• scientific article; zbMATH DE number 937366

Cited in

(10)

• Uniform interpolation from cyclic proofs: the case of modal mu-calculus
• Proof spaces for unbounded parallelism
• scientific article; zbMATH DE number 1956528 (Why is no real title available?)
• Towards a Semantics of Unsatisfiability Proofs with Inprocessing
• Gluing resource proof-structures: inhabitation and inverting the Taylor expansion
• Infinitary proof theory: the multiplicative additive case
• Cyclic implicit complexity
• Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
• Computational expressivity of (circular) proofs with fixed points
• Cyclic implicit complexity

This page was built for publication: Infinets: the parallel syntax for non-wellfounded proof-theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180524)