Certain (and Possible) Answers

Synonyms

True answer (Maybe answer); Validity (Satisfiability)

Definition

Let T be a finite theory expressed in a language L, and φ an L-sentence. Then T finitely entails φ, in notation T ⊧ φ, if all finite models of T also are models of φ. A theory T is said to be complete in the finite if for each L-sentence φ either T ⊧ φ or T ⊧ ¬φ. In particular, if T is incomplete (not complete in the finite), then there is an L-sentence φ, such that T ⊭ φ and T ⊭ ¬φ. It follows from classical logic that a first order theory is complete in the finite if and only if all its finite models are isomorphic. Consider now a theory

$${T_1} = \left\{\matrix{R(a,b) \wedge R(a,c), \cr \forall x,y : R(x,y) \rightarrow (x,y) = (a,b) \vee (a,c),\cr a \neq b, a \neq c, b \neq c.}\right.$$

where a, b, and c are constants. This theory is complete, and clearly for instance T ⊧ R(a, b), T ⊧ R(a, c), and T ⊭ R(d, c), for all constants d different from a and b. Consider then the theory

$${T_2} = \left\{\matrix{R(a,b)...