[andrewdb]

An over-simplified approach that would be interesting to explore:

1. Given a collection of logical arguments, figure out how to assign a hash to each argument.

2. Build a Merkle tree representing the argument's hashes, nesting according to first principles.

3. If an argument is challenged successfully, the argument's hash changes, rendering descendent argument hashes invalid.