

-----------------------------------

bookface

Mon Jan 10, 2011 2:04 pm


Satisfiable and First Order Logic

-----------------------------------

The question is "write down a formula that is satisfiable but it has only infinite models"  for some G (graph) = (V,E)  where V is some set of vertices, and E, edges, some subset of V X V.  

Satisfiable means that the formula evaluates at least once to true.  

Only infinite models...how can this be captured??

