Propositional Logic
CSC 261 - Weinman


Answer the following questions. Record your answers in your Reading Journal.
  1. In your own words, distinguish between the properties of soundness and completeness in propositional logic.
  2. One might consider the algorithm TT-CHECK to be yet another search algorithm (Y.A.S.A.?) wearing a "logic"al mask. Among those we have studied, which search algorithm do you find it to be most similar to? Briefly explain your choice.
  3. Give an interpretable sentence in English (corresponding to how one might read aloud a sentence of propositional logic ) that is
    1. valid, and a sentence that is
    2. satisfiable, and one last sentence that is
    3. unsatisfiable.
    For example, "The weather is rainy" is a propositional assertion phrased in English, rather than the more symbolic R. Briefly explain why each of your sentences meets the definition of these terms.


File translated from TEX by TTH, version 3.80.
On 22 Sep 2009, 14:32.