By censoring I mean a specific technique for forcing the consistency of a possibly inconsistent set of axioms.
Suppose you have a set of deduction rules over a language . You can construct a function that takes a set of sentences and outputs all the sentences that can be proved in one step using and the sentences in . You can also construct a censored by letting .
When considering an embedder F, in universe U, in response to which SADT picks policy π, I would be tempted to apply the following coherence condition:
E[F(π)]=E[F(DDT)]=E[U]
(all approximately of course)
I'm not sure if this would work though. This is definitely a necessary condition for reasonable counterfactuals, but not obviously sufficient.