By: |
|
1 |
((i:0. P(i)) 0<search(0;P)) & (0<search(0;P) P(search(0;P)-1) & (j:0. j<search(0;P)-1 P(j))) | 1 step |
2 |
2. 0<k 3. P:((k-1)). 3. ((i:(k-1). P(i)) 0<search(k-1;P)) 3. & (0<search(k-1;P) 3. & ( 3. & (P(search(k-1;P)-1) & (j:(k-1). j<search(k-1;P)-1 P(j))) P:(k). ((i:k. P(i)) 0<search(k;P)) & (0<search(k;P) P(search(k;P)-1) & (j:k. j<search(k;P)-1 P(j))) | 19 steps |
About: