Complete Systematic Tableaux Definition(Complete systematic tableaux) Let r be a signed proposition. We define the complete systematic tableau(CSt) with root entry R by induction o Let To be the unique atomic tableau with r at its root. Q Assume that Tm has been defined. Let n be the smallest level of Tm and let e be the leftmost such entry of level n O Let Tm+i be the tableau gotten by adjoining the unique atomic tableau with root e to the end of every noncontradictory path of Tm on which E is unreduced The union of the sequence Tm is our desired complete systematic tableauComplete Systematic Tableaux . Definition (Complete systematic tableaux) . . Let R be a signed proposition. We define the complete systematic tableau(CST) with root entry R by induction. 1. Let τ0 be the unique atomic tableau with R at its root. 2. Assume that τm has been defined. Let n be the smallest level of τm and let E be the leftmost such entry of level n. 3. Let τm+1 be the tableau gotten by adjoining the unique atomic tableau with root E to the end of every noncontradictory path of τm on which E is unreduced. The union of the sequence τm is our desired complete systematic tableau. Yi Li (Fudan University) Discrete Mathematics April 9, 2013 9 / 14