Guest User

Untitled

a guest
May 24th, 2018
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.03 KB | None | 0 0
  1. Chapter 06
  2. Chapter Summary
  3. In propositional logic we use symbols to stand for the relationships between statements"that is, to indicate the form of an argument. These relationships are made possible by logical connectives such as conjunction (and), disjunction (or), negation (not), and conditional (If" then"). Connectives are used in compound statements, each of which is composed of at least two simple statements. A simple statement is a sentence that can be either true or false.
  4.  
  5. To indicate the possible truth values of statements and arguments, we can construct truth tables, a graphic way of displaying all the truth value possibilities. A conjunction is false if at least one of its statement components (conjuncts) is false. A disjunction is still true even if one of its component statements (disjuncts) is false. A negation is the denial of a statement. The negation of any statement changes the statement's truth value to its contradictory (false to true, and true to false). A conditional statement is false in only one situation"when the antecedent is true and the consequent is false.
  6.  
  7. The use of truth tables to determine the validity of an argument is based on the fact that it's impossible for a valid argument to have true premises and a false conclusion. A basic truth table consists of two or more guide columns listing all the truth value possibilities, followed by a column for each premise and the conclusion. We can add other columns to help us determine the truth values of components of the argument.
  8.  
  9. Some arguments are complex when variables and connectives are combined into larger compounds and when the number of variables increases. To prevent confusion, we can use parentheses in symbolized arguments to show how statement or premise components go together.
  10.  
  11. You can check the validity of arguments not only with truth tables but also with the short method. In this procedure we try to discover if there is a way to make the conclusion false and the premises true by assigning various truth values to the argument's components.
Add Comment
Please, Sign In to add comment