Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
sav08:preliminary_discussion_on_models [2009/05/14 12:34]
vkuncak
sav08:preliminary_discussion_on_models [2012/04/23 10:17] (current)
vkuncak
Line 13: Line 13:
 Difficulty in checking $\models S$: there are infinitely many models, of arbitrarily large cardinalities. Difficulty in checking $\models S$: there are infinitely many models, of arbitrarily large cardinalities.
  
-Goal: show that if a set $S$ of formulas has a model, then it has a particular kind, and this model is countable.+Goal: show that if a set $S$ of formulas has a model, then it has a particular kind of a model, and this model is countable.
   * this will also give us a systematic method to search for unsatisfiable (and thus, for valid) formulas   * this will also give us a systematic method to search for unsatisfiable (and thus, for valid) formulas
  
  
 
sav08/preliminary_discussion_on_models.txt · Last modified: 2012/04/23 10:17 by vkuncak
 
© EPFL 2018 - Legal notice