Level n arguments
Let an attack relation on (abstract) arguments be given.
1. All arguments are in at level 0.
2. An argument is in at level n + 1 if and only if it is not attacked by any argument that is in at level n.
? Cf. Pollock’s theory of defeasible reasoning
? The argument statuses in/not in can be read as undefeated/defeated. Note however that the resulting status assignments are not always stages, since there can be arguments attacking each other that are in at some level.