CSE 563, Spring 2003

HOMEWORK #3: PROPOSITIONAL LOGIC

Last Update: 17 February 2003

Note: NEW or UPDATED material is highlighted

This is adapted from Russell & Norvig, 2nd edition, p. 237, #7.8.

Consider the following syntax and semantics for a propositional KR language:

Syntax: The following are all and only the atomic well-formed formulas ("wffs"):

Semantics:


A.
Using this language, represent the following English sentences:

  1. If there is smoke, then someone is dumb.
  2. Either there is no smoke, or someone is dumb.
  3. If someone is not dumb, then there is no smoke.
  4. There is smoke. If there is smoke, then there is fire. Therefore, there is fire.

Now, consider the following molecular wffs in this language.

Note: Due to limitations of HTML, I will use:

Note: Sometimes, I will omit parentheses when there is no ambiguity or when they would be distracting.

  1. (Smoke -> Smoke)

  2. (Smoke -> Fire)

  3. ((Smoke -> Fire) -> (~Smoke -> ~Fire))

  4. (Smoke v Fire v ~Fire)

  5. ((Smoke ^ Heat) -> Fire) <-> ((Smoke -> Fire) v (Heat -> Fire))

  6. (Smoke -> Fire) -> ((Smoke ^ Heat) -> Fire)

  7. Big v Dumb v (Big -> Dumb)

  8. (Big ^ Dumb) v ~Dumb

B.
Using the semantics given above, translate these wffs into English.


C.
Using truth tables, determine which of the above wffs are:

DUE: AT THE BEGINNING OF LECTURE, WEDNESDAY, FEB. 19



Copyright © 2003 by William J. Rapaport (rapaport@cse.buffalo.edu)
file: 563/hw03.2003.02.17.html