The following pages link to (Q2778837):
Displaying 6 items.
- Cut elimination for GLS using the terminability of its regress process (Q288243) (← links)
- Inductive proof search modulo (Q1037404) (← links)
- Strong normalisation of cut-elimination in classical logic (Q2708321) (← links)
- Lexicographic Path Induction (Q3637202) (← links)
- (Q5039187) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)