The following pages link to A proof theory for model checking (Q2331070):
Displaying 5 items.
- Non-well-founded deduction for induction and coinduction (Q2055840) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
