  Model semantics for first-order predicate logic is characterized by a visual
inference tool called semantic forcing trees for predicate logic. Formulas that
are valid (or invalid) by semantic forcing trees match valid (or invalid)
formulas by the usual valuation semantics. In the event that the formula is
invalid by a forcing tree, a model that refutes it is determined by the marks
of the leaves of this tree.
