Pages that link to "Item:Q1948276"
From MaRDI portal
The following pages link to Cut elimination for a logic with induction and co-induction (Q1948276):
Displaying 13 items.
- The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey (Q287277) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Cut-elimination for a logic with definitions and induction (Q1575931) (← links)
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- A proof theory for model checking (Q2331070) (← links)
- Extracting Proofs from Tabled Proof Search (Q2938048) (← links)
- CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT (Q4295221) (← links)
- (Q4993349) (← links)
- (Q5014803) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Types for Proofs and Programs (Q5712312) (← links)