The following pages link to (Q5144621):
Displaying 18 items.
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Contributed papers. Restriction on cut in cyclic proof system for symbolic heaps (Q2039937) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Complete axiomatization of the stutter-invariant fragment of the linear time \(\mu\)-calculus (Q2904051) (← links)
- The Complexity of Enriched Mu-Calculi (Q3535618) (← links)
- (Q5079760) (← links)
- (Q5094136) (← links)
- (Q5155678) (← links)
- (Q5208872) (← links)
- (Q5214813) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711494) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points (Q6541152) (← links)
- Ill-founded proof systems for intuitionistic linear-time temporal logic (Q6541154) (← links)
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata (Q6541156) (← links)
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs (Q6649500) (← links)
