Completeness 「The eorem Suppose P is a noncontradictory path through a complete systematic tableau T from S with root Fa There is then a structure A in which a is false and every sentence in s is trueCompleteness . Theorem . . Suppose P is a noncontradictory path through a complete systematic tableau τ from S with root Fα. There is then a structure A in which α is false and every sentence in S is true. Yi Li (Fudan University) Discrete Mathematics June 4, 2013 6 / 17