Test 1, at class time on October 25, may include the following tasks:
- Define “logically valid.”
- Answer true-false questions using the terms/concepts from the vocabulary sheet, very similar to the true-false exercises you’ve done.
- Look at one or more English sentences, and construct a symbolization key for the atomic TFL sentences in them—a key that is adequate to bring out their truth-functional structure.
- Using a given symbolization key, symbolize English sentences in TFL.
- Using a given symbolization key, translate symbolized TFL sentences into English.
- Construct truth tables for symbolized sentences to show, variously:
- whether a sentence is a necessary truth, necessary falsehood, or contingent;
- whether a set of sentences is consistent (jointly possible) or not;
- whether an argument is logically valid or not.
- For a constructed truth table (like those in the item immediately above), write a sentence saying why/how it shows the answer to the question.
- Use the fitch-style natural deduction proof system we have learned to prove the validity of arguments in TFL, using the rules: reiteration, conjunction introduction, conjunction elimination, conditional elimination, and biconditional elimination.