n-Trace in Propositional Logic
For a set of logical streams T, potentially providing inconsistent sentences,
all pairs of inputs
can be processed by a partitioning function f
In the case of three inputs, the
function effectively conjoins all possible pairs of inputs and disjoins the results
where
and
are specific sentences from the three inputs.
Thus, for a set of inputs
= {a,b,c},
the resulting set of sentences are
