1. | Define tautologousness by completing the following: ⇒ φ if and only if … . (Your answer need not replicate the wording of the text’s definitions, but it should define tautologousness in terms of truth values and possible worlds.)
answer |
2. |
Suppose you know that φ ⇒ χ and that ψ ⇒ χ (i.e., χ is implied, or entailed, by each one of φ and ψ). Can you conclude that φ ⇔ ψ (i.e., φ and ψ are equivalent)? Explain why or why not by reference to the definitions of entailment and equivalence, making explicit reference to the possibilities of truth and falsity mentioned in these definitions.
answer |
3. |
Give your own example of a true sentence with a false implicature, using the definition of implicature to explain why it is an example. [The originality of the example counts for something here but your explanation is the more important aspect of the answer.]
answer |
4. |
Analyze the sentence below in as much detail as possible, presenting the result in both symbolic and English notation. Be sure that the unanalyzed components of your answer are complete and independent sentences; also try to respect any grouping in the English.
Sam finished the job even though he was tired and it wasn’t urgent.
answer
|
Use the basic system of derivations (i.e., no replacement rules) to check whether each of the entailments below holds. If one fails, provide a table in which you calculate the truth values of the premises and conclusion on an extensional interpretation (i.e., an assignment of truth values) which divides an open gap. | ||
5. |
(A ∧ B) ∧ C ⇒ C ∧ A
answer |
|
6. | A ∧ D, E ∧ A ⇒ (A ∧ B) ∧ C
answer |
7. |
[This question was on a topic not covered in F06]
Use replacement principles to put the following sentence into list normal form (in which no conjunction is the left component of a conjunction and letters appear in alphabetical order without repetition):
A ∧ ((B ∧ A) ∧ C)
answer
|
1. | ⇒ φ if and only if there is no possible world in which φ is false. |
5. |
|
7. |
[This question was on a topic not covered in F06]
A ∧ ((B ∧ A) ∧ C)
⇔ A ∧ ((A ∧ B) ∧ C) ⇔ A ∧ (A ∧ (B ∧ C)) ⇔ (A ∧ A) ∧ (B ∧ C) ⇔ A ∧ (B ∧ C) |