Comparing infinitary systems for linear logic with fixed points

DOI10.4230/LIPICS.FSTTCS.2023.40MaRDI QIDQ6951693zbMATH OpenFDO

Authors Anupam Das, Abhishek De, Alexis Saurin

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.40

zbMATH Keywords

analytical hierarchyfixed pointslinear logicnon-wellfounded proofsomega-branching proofs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A finite model theorem for the propositional \(\mu\)-calculus
• An infinitary sequent system for the equational theory of *-continuous action lattices
• Analytic determinacy and 0^#
• Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
• Complexity of commutative infinitary action logic
• Cyclic proofs for the first-order -calculus
• Decision problems for linear logic with least and greatest fixed points
• Decision problems for propositional linear logic
• Dialogues, strategies, and intuitionistic provability
• Elementary induction on abstract structures
• Finite investigations of transfinite derivations
• Fixed Point Logics
• Fixed points in Peano arithmetic with ordinals
• Games for the -calculus
• Higher recursion theory
• scientific article; zbMATH DE number 6680140 (Why is no real title available?)
• scientific article; zbMATH DE number 4068856 (Why is no real title available?)
• scientific article; zbMATH DE number 2087442 (Why is no real title available?)
• scientific article; zbMATH DE number 1882496 (Why is no real title available?)
• scientific article; zbMATH DE number 7297836 (Why is no real title available?)
• scientific article; zbMATH DE number 7155168 (Why is no real title available?)
• Infinitary proof theory: the multiplicative additive case
• Least and greatest fixed points in linear logic
• Least and greatest fixed points in linear logic
• Linear logic
• Non-uniform complexity via non-wellfounded proofs
• On the proof theory of the modal mu-calculus
• Phase semantics for linear logic with least and greatest fixed points
• Results on the propositional \(\mu\)-calculus
• Sequent calculi for induction and infinite descent
• The logical syntax of language.

Cited in

(3)

• Intuitionistic Gödel-Löb without sharps
• On the reverse mathematics of cut-elimination and determinacy
• A proof theory of ( -)context-free languages, via non-wellfounded proofs

This page was built for publication: Comparing infinitary systems for linear logic with fixed points

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