Cyclic proofs, hypersequents, and transitive closure logic
From MaRDI portal
Publication:2104539
Cites work
- scientific article; zbMATH DE number 408795 (Why is no real title available?)
- scientific article; zbMATH DE number 6863660 (Why is no real title available?)
- scientific article; zbMATH DE number 7155168 (Why is no real title available?)
- A cut-free cyclic proof system for Kleene algebra
- Automated cyclic entailment proofs in separation logic
- Automatically verifying temporal properties of pointer programs with cyclic proof
- Automatically verifying temporal properties of pointer programs with cyclic proof
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
- Complete systems of \(\mathcal B\)-rational identities
- Focused labeled proof systems for modal logic
- Games for the \(\mu\)-calculus
- Handbook of modal logic
- Infinitary proof theory: the multiplicative additive case
- Integrating induction and coinduction via closure operators and proof cycles
- Languages that Capture Complexity Classes
- Modal logic
- Non-well-founded proof theory of transitive closure logic
- On the proof theory of the modal mu-calculus
- Sequent calculi for induction and infinite descent
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
Cited in
(4)
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)