1 problem
- 0 votes0 replies0 views
Necessity of conjunction for simulating big-step induction over lists
Let . By denote the set of all clauses, that is, disjunctions of atoms and their negations, over the language . Let be…
Necessity of conjunction for simulating big-step induction over lists
Let . By denote the set of all clauses, that is, disjunctions of atoms and their negations, over the language . Let be…