Presentation is loading. Please wait.

Presentation is loading. Please wait.

Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction.

Published byPedro Carvalho Modified over 5 years ago

Similar presentations

Presentation on theme: "Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction."— Presentation transcript:

1 Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction will be true.

2 T T T T T F F T T Valid

3

4

5

6 T T T T T T T T T T F T T Valid

7 T T F T T T T T ? ? ?

8 Conjunctive Simplification Conjunctive Simplification Conjunctive Addition Conjunctive Addition Disjunctive Addition Conjunctive Addition Disjunctive Syll. Modus Tollens Conjunctive Simp. Modus Ponens Modus Tollens Disjunctive Addition

9 T F T T T T T T Valid

10 T T ? F T T ?

11 T T T T F T T T T Valid

12 T T T F T T T T T T Valid

13 T F T T F F T T T T Valid

14 T T T T T T T T Valid

15 T T T ? T T T T ?

16 F F T T T F T T T T Valid

17 T T T T F T F F T Valid

18 F F F T T T T T T Valid

19 T F T T T T T

20 F F T T F F F F T T T ?

21 T T T T T T T T F T T T T T T Valid

22 T T T T T F T F T T T T T T T VALID

23

24

25 T T T T T T T T T T T T VALID

Download ppt "Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction."

Similar presentations

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.

Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.

2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.

CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.

Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.

Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.
A compound statement is made up of more than one equation or inequality. A disjunction is a compound statement that uses the word or. Disjunction: x ≤

A compound statement is made up of more than one equation or inequality. A disjunction is a compound statement that uses the word or. Disjunction: x ≤
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.

Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Thinking Mathematically

Thinking Mathematically
CHAPTER 1 – EQUATIONS AND INEQUALITIES 1.6 – SOLVING COMPOUND AND ABSOLUTE VALUE INEQUALITIES Unit 1 – First-Degree Equations and Inequalities.

CHAPTER 1 – EQUATIONS AND INEQUALITIES 1.6 – SOLVING COMPOUND AND ABSOLUTE VALUE INEQUALITIES Unit 1 – First-Degree Equations and Inequalities.
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.

9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
Warm-Up Let A = {0,1,3,8}, B = {2,4,5,6,7,9}, and C = {0,1,8}. 4 minutes Find the following sets.

Warm-Up Let A = {0,1,3,8}, B = {2,4,5,6,7,9}, and C = {0,1,8}. 4 minutes Find the following sets.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.

Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
Alg2 Lesson 1-4 Solving Inequalities Objectives: 1.Solve inequalities. 2.Solve combined inequalities. 3.Identify conjunctions and disjunctions. 4.Graph.

Alg2 Lesson 1-4 Solving Inequalities Objectives: 1.Solve inequalities. 2.Solve combined inequalities. 3.Identify conjunctions and disjunctions. 4.Graph.
Today’s Topics Argument forms and rules (review)

Today’s Topics Argument forms and rules (review)
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.

 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
Formal logic The part of logic that deals with arguments with forms.

Formal logic The part of logic that deals with arguments with forms.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =

L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.

March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Presented by: Tutorial Services The Math Center

Presented by: Tutorial Services The Math Center

Similar presentations

Ads by Google