|
|
This is only a preview of the paper
Click here to register and get the full text.
Existing members click here to login
|
|
|
Chapter 1 Summary Section 1.1 (Statements, Symbolic Representation, and Tautologies) This section introduces what a statement/proposition is and identifies the different types of logical connectors and statement letters. The author then leads into what a tautology is. The idea of a well formed formula (wff) also comes into play. Using these ideas the section shows how to put an English sentence into formal logic and determine if the statement is true or false. Statement/Proposition- a sentence that is either true or false Statement letters- letters of the alphabet that represent statements Conjunction/Conjuncts- Statements that contain the word ¡§and¡¨ Disjunction/Disjuncts- Statements that contain the word ¡§or¡¨ Implication- Symbol that means if one statement happens then the other happens also Antecedent- comes first in an implication statement Consequent- depends upon the Antecedent Equivalence- means that 2 statements are true Negation- opposite of the symbol Well formed formula (wff) - a legitimate string with the correct number of parentheses Tautology- A wff whose value is always true Contradiction- A wff whose value is always false Algorithm- a set of instructions that can be mechanically executed in a finite amount of time in order to solve some problem The testable material in this section is definitely the truth tables.
Approximate Word count = 770
Approximate Pages = 3.1
(250 words per page double spaced)
|
|
|
|
|
|