display all the ideas for this combination of texts
3 ideas
15406 | 'Induction' and 'recursion' on complexity prove by connecting a formula to its atomic components [Burgess] |
15426 | We can build one expanding sequence, instead of a chain of deductions [Burgess] |
15425 | The sequent calculus makes it possible to have proof without transitivity of entailment [Burgess] |