The following pages link to (Q4417874):
Displayed 17 items.
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus (Q2142087) (← links)
- Temporal refinements for guarded recursive types (Q2233479) (← links)
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic (Q2988374) (← links)
- On global induction mechanisms in a<i>μ</i>-calculus with explicit approximations (Q4460690) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q5079741) (← links)
- (Q5094136) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- (Q5208872) (← links)
- Well-founded recursion with copatterns and sized types (Q5371960) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- Compositional Coinduction with Sized Types (Q5739446) (← links)
- Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← links)