1. The document provides a problem set involving symbolic logic with 8 problems. The problems involve representing sentences symbolically, writing negations of quantified statements, translating quotations symbolically, constructing truth tables for compound statements and arguments, and determining validity of arguments using truth tables.
1. The document provides a problem set involving symbolic logic with 8 problems. The problems involve representing sentences symbolically, writing negations of quantified statements, translating quotations symbolically, constructing truth tables for compound statements and arguments, and determining validity of arguments using truth tables.
1. The document provides a problem set involving symbolic logic with 8 problems. The problems involve representing sentences symbolically, writing negations of quantified statements, translating quotations symbolically, constructing truth tables for compound statements and arguments, and determining validity of arguments using truth tables.
Solve the following problems by also showing your complete solution.
Reminder: 1-problem per page in a PDF format will be submitted/uploaded for your solutions. Don’t forget to write your names in your papers. 1. Write each sentence in symbolic form. Represent each component of the sentence with the letter indicated in parentheses. Also state whether the sentence is a conjunction, a disjunction, a negation, a conditional, or a biconditional. 1.1. All squares (s) are rectangles (r). 1.2. A triangle is an equilateral triangle (l) if and only if it is an equiangular triangle (a). 1.1. I will major in mathematics (m) or computer science (c). 2. Write the negation of each quantified statement. 2.1. Some cats do not have claws. 2.2. All classic movies were first produced in black and white. 2.3. None of the numbers were even numbers. 3. Translate each quotation into symbolic form. For each component, indicate what letter you used to represent the component. 3.1. If you can count your money, you don’t have a billion dollars. 3.2. Those who do not learn from history are condemned to repeat it. 4. Construct a truth table for each compound statement. 4.1. p Λ ~ q 4.2. ( p Λ ~ q ) ꓦ [ ~ ( p Λ q ) ] 4.3. ( ~ q Λ r ) ꓦ [ p Λ ( q Λ ~ r)] 5. Construct a truth table for the given statement. 5.1. [ ~ ( p → ~ r) Λ ~ q ] → r 5.2. [ ( p → q ) ꓦ ( r Λ ~ p)] → (r ꓦ ~ q) 6. Construct a truth table for the statement to determine if the statement is equivalent. 6.1. ~ p → ( p ꓦ r) ; r 7. Use a truth table to determine whether the argument is valid or invalid. 𝑝∨∼𝑞 ∼𝑞 7.1. ∴𝑝 (𝑝→𝑞)∧(~𝑝→𝑞) 𝑞 7.2. ∴𝑝 8. Use the indicated letters to write the argument in symbolic form. Then use a truth table to determine whether the argument is valid or invalid. 8.1. If you finish your homework (h) you may attend the reception(r). You did not finish your homework. Therefore, you cannot go to the reception. 8.2. If I can’t buy the house (~b) then at least I can dream about it (d). I can buy the house or at least I can dream about it. Therefore, I can buy the house.