The document discusses different types of logical statements such as propositions, conjunctions, disjunctions, conditionals, and biconditionals. It defines these terms and provides examples to illustrate each type of statement. Truth tables are introduced as a way to represent the relationships between the truth values of simple propositions and compound propositions using logical connectives.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
855 views
Logic
The document discusses different types of logical statements such as propositions, conjunctions, disjunctions, conditionals, and biconditionals. It defines these terms and provides examples to illustrate each type of statement. Truth tables are introduced as a way to represent the relationships between the truth values of simple propositions and compound propositions using logical connectives.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 40
LOGIC
Proposition and Symbols
October 9, 2017 Lesson Outline • Proposition •Simple and Compound Proposition Entry Card Classify each sentence as declarative, imperative, interrogative , or exclamatory. 1. The principal will visit classes starting next week. Declarative 2. Ouch ! I cut my finger. Exclamatory 3. Turn right at the fourth traffic sign. Imperative
4. Have you heard of the good news? Interrogative
5. Please reserve December 7 for me. Imperative Kinds of Sentences Simple sentence is a sentence that contains two or more independence clauses.
Compound Sentence is a sentence that contains
two or more independence clauses joined by conjunctions( for, nor, but, or, yet, so), semicolons, or semicolon followed by conjunctive adverb. Kinds of Sentences
Complex Sentence is a sentence that contains
one independent clause and one or more dependent clause. Compound –complex Sentence is a compound sentence with one or more independent clause. Sentences are classified as follows Declarative Sentence is used to make statement of fact, wish , intent or feeling, Example – I wish I could visit my grandparents this summer. Imperative Sentence is used to state a command, request , or direction . Example- Please do not answer in chorus. Sentences are classified as follows Interrogative Sentence is used to ask a question. Example – Did you prepare for the final exam.
Exclamatory Sentence is used to express
strong feelings. Example-The teacher shouted, “ Keep Quiet!” What is Logic? Who invented Logic?
How many kind of logic are there?
Which sentence can be answered as either true or false 1. Rowena is passing in Mathematics. 2.Pass the paper and then leave the room. 3. December 7, 1953 was a Monday. 4.When will you submit your paper? 5. 5 + 3 = 8 and 12- 7 = 5 DEFINITION PROPOSITION is a declarative sentence that can be classified as true or false The sentence 1,3, and 5 are proposition.
1. Rowena is passing in Mathematics.
3. December 7, 1953 was a Monday. 5. 5 + 3 = 8 and 12- 7 = 5 The truth or falsity of each can be determined by a direct check, The sentence 2,and 4 cannot be answered as being true or false 2.Pass the paper and then leave the room.
4.When will you submit your paper?
Sentence 2 is a command ( imperative
sentence) and sentence 4 is a question ( interrogative sentence) Examples of Proposition? • It is raining. • The temperature in this hot summer is 33º C in Manila. • The K to 12 curriculum of DepEd is success. • A line is an infinite set of points • Parallel lines will never meet however long you extend them. • Our solar system is the only solar system in the universe. • A point has one dimension • x + 4 = 12 , if x = 5 • Teachers are all men • All dogs bark. These are not proposition • Clean the table before you go. • Are you hurt? • Is there life after death? • 12 + 3x = 25 • Please wear your ID before you enter the school premises. It is important that when we analyse arguments or logical expressions, we should break down a sentence to some composition of simple sentences. Given the statement ‘I can play the guitar and piano.” This is a combination of two sentences ( p) I can play the guitar, and (q) I can play he piano.
We can create compound proposition using propositional
variables ( p, q, r, s, …) And connectives or logical operators ( ≡ , ~, ᐱ, ᐯ , →, ↔). Words connectives such as and, or, not, and if ….then. Logical Operators Conjunction Two simple propositions connected using the word and. p and q pᐱq Disjunction Two simple propositions that are connected using the word or. p or q pᐯq Logical Operators Conditional Two simple propositions connected using the word if …then. if p , then q p→q Biconditionals Conjuctions of two conditional statements where the antecedent and consequent of the first statement have been switched in the second statement. p if and only if q p↔q Logical Operators Negation The negation of a given statement is a statement that is false whenever the given statement is true, and true whenever the given statement is false. not p , but not q ~p ᐱ~q Summary : Logical Operators Type of Connectives Symbols Statement Conjunction p and q pᐱq Disjunction p or q Pᐯq Conditional If p, then q p→𝑞 Biconditional p if and only if q p↔𝑞 Negation Not p but not q ~𝑝 ᐱ ~ 𝑞 Example p : I can play the guitar q: I can play the piano Conjunction p ᐱ q I can play the guitar and the piano. Disjunction P ᐯ q I can paly the guitar or the piano. Conditional p → 𝑞 If I can paly the guitar, then I can play the piano. Biconditional p ↔ 𝑞 I can play the guitar if and only if I play the piano. Negation ~𝑝 ᐱ ~ 𝑞 I cannot play the guitar nor the piano. Parentheses in symbolic statements are used to tell what type of statement are being considered. If there are no parentheses, we follow the dominance of connectives. The list below gives the connectives in their dominant order( from the strongest to the weakest) a. Bi-conditional b. Conditional c. Disjunction , Conjunction d. Negation The conjunction and disjunction are equal value. Example- Identify each symbolic statement as a conjunction, disjunction, negation, conditional, or bi- conditional. a. P ᐯ Q ↔ 𝑅 a. Bi- conditional The double arrow is the dominant connective and there are no parentheses.
b. (P ᐱ Q ) ᐯ 𝑅 b. Disjunction The parentheses separate
the statement at the “v” connective. c.~ (P ᐯ Q ) c. Negation The statement is inside the parentheses Example- Identify each symbolic statement as a conjunction, disjunction, negation, conditional, or bi- conditional. There are no parentheses. Thus, the conditional arrow stronger than any d. ~ P ᐱ Q → 𝑅 ᐯ 𝑆 d. Condition of the other connectives. The antecedent is ~ P ᐱand the consequent is 𝑅 ᐯ 𝑆. The negative sign is outside e. ~ ( P → Q ᐱ 𝑅) e. Negation the parentheses and the conditional arrow is inside the parentheses. f. P ᐱ (Q → 𝑅) f. Conjunction The parentheses separate the statement at the “ ᐱ“. Connective. Truth Tables for Equivalent Propositions What are truth Table? Truth tables represent the relationship between the truth values of propositions and compound proposition drawn from the given propositions. Type of Statements and their Connective Symbols Type of Connectives Symbols Statement Conjunction and ᐱ Disjunction or ᐯ Conditional If…then → Biconditional if and only if ↔ Negation not… ~ Connective in their dominant order: 1.Biconditional ( ↔) 2.Conditional (→) 3.Conjunction ( ᐱ) , Disjunction (ᐯ) 4.Negation ( ~ ) A teacher promised her students, “ If you pass the final examination and submit all the requirements, then you may join the graduation.” The students passes only the final exam, but the teacher allows her to join the graduation. Has the teacher broken her original promise? Truth Table for Conjunction Conjunction p and q pᐱq “ I eat ampalaya and kangkong.” p : I eat ampalaya q: I eat kangkong p q pᐱq The conjunction p ᐱ q of p and q is the T T T proposition that is true only if both p and q are TRUE, if T F F either one is FALSE, the statement is FALSE, or both statements are FALSE, the statement is FALSE. F T F F F F Disjunction p or q pᐯq “ I eat ampalaya or kangkong.” p : I eat ampalaya q: I eat kangkong
p q pᐯq The conjunction p ᐱ q of p and q is the
T T T proposition that is true If both p and q are TRUE, if T F T either one is FALSE, the statement is TRUE, If both statements are FALSE, the statement is FALSE. F T T F F F Conditional if p , then q (p → q) 1. P is sufficient for q 2. P implies q 3. q follows from p The conditional p → q of p and q is the p q p→q proposition that is true If both p and q are TRUE, if p is T T T FALSE and q is TRUE, , the statement is TRUE, If both statements are FALSE, the statement is TRUE, but if q is T F F FALSE and p is TRUE , the statement is FALSE. F T T F F T If a student got 60% or more points from the written test, then he will pass the subject Math 53. Truth Tables Let p: A student got 60% or more points from the written test. p q p →q q: He will pass Math 53 T T T The conditional or implication p→ 𝑞 of p T F F and q is the proposition that is TRUE if both p F T T and q are TRUE, if p is FALSE and q is TRUE, F F T the statement is TRUE, if both statements are FALSE, the statement is TRUE, but if q is FALSE and p is TRUE, the statement is FALSE. Biconditional p if and only if q (p ↔ q) Truth Tables The Biconditional p → q of p and q is the p q p↔q proposition that is true if both p and q are TRUE or if T T T both p and q are FALSE, If either one is FALSE, the T F F statement is FALSE. F T F F F T A student will pass Math 53 if and only if he got 60% or more points from the written tests. Truth Tables Let p: A student will pass Math 53 p q p→q q: He will get 60% or more points from the T T T written test. T F F The conditional or implication p→ 𝑞 of p F T F and q is the proposition that is TRUE if both p F F T and q are TRUE, if p is FALSE and q is TRUE, the statement is TRUE, if both statements are FALSE, the statement is TRUE, but if q is FALSE and p is TRUE, the statement is FALSE. Negation if p, then ~ 𝑝 ( read “ not p”) Truth Tables The Negation of a true statement is always FALSE. p ~𝒑 The Negation of a false statement is always true. T F F T Example 1. Construct a true table for ~ ( 𝑷 ᐱ 𝑸) P Q PᐱQ ~ ( 𝑷 ᐱ 𝑸) T T T F T F F T F T F T F F F T Example 1. Construct a true table for ~ ( 𝑷 ᐯ 𝑸) P Q 𝑷ᐯ𝑸 ~ ( 𝑷 ᐯ 𝑸) T T T F T F T F F T T F F F F T Example 1. Construct a true table for ~ ( 𝑷 ᐱ ~𝑸) P Q ~Q 𝑷 ᐱ ~𝑸 ~ ( 𝑷 ᐱ~ 𝑸) T T F F T T F T T F F T F F T F F T F T