Cyclic proofs, hypersequents, and transitive closure logic
From MaRDI portal
Publication:2104539
DOI10.1007/978-3-031-10769-6_30OpenAlexW4289104024MaRDI QIDQ2104539FDOQ2104539
Authors: Anupam Das, Marianna Girlando 
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2205.08616
Cites Work
- Modal logic
- Title not available (Why is that?)
- Handbook of modal logic
- Languages that Capture Complexity Classes
- Complete systems of \(\mathcal B\)-rational identities
- Sequent calculi for induction and infinite descent
- On the proof theory of the modal mu-calculus
- Games for the \(\mu\)-calculus
- Title not available (Why is that?)
- A cut-free cyclic proof system for Kleene algebra
- Focused labeled proof systems for modal logic
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
- Automated cyclic entailment proofs in separation logic
- Infinitary proof theory: the multiplicative additive case
- Integrating induction and coinduction via closure operators and proof cycles
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
- Non-well-founded proof theory of transitive closure logic
- Title not available (Why is that?)
- Automatically verifying temporal properties of pointer programs with cyclic proof
- Automatically verifying temporal properties of pointer programs with cyclic proof
Cited In (4)
Uses Software
This page was built for publication: Cyclic proofs, hypersequents, and transitive closure logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104539)
