Logic In Part 2 Modules 1 through 5, our topic is symbolic logic.

Slides:



Advertisements
Similar presentations
Test the validity of this argument: Some lawyers are judges. Some judges are politicians. Therefore, some lawyers are politicians. A. Valid B. Invalid.
Advertisements

Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
Test the validity of this argument: Some lawyers are judges. Some judges are politicians. Therefore, some lawyers are politicians. A. Valid B. Invalid.
An overview Lecture prepared for MODULE-13 (Western Logic) BY- MINAKSHI PRAMANICK Guest Lecturer, Dept. Of Philosophy.
Part 1 Module 2 Set operations, Venn diagrams
Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
3.8 Unions and Intersections of Sets. Set operations Let U = {x|x is an English-language film} Set A below contains the five best films according to the.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
Chapter 2 The Basic Concepts of Set Theory
Logic In Part 2 Modules 1 through 5, our topic is symbolic logic. We will be studying the basic elements and forms that provide the structural foundations.
Chapter 3: Set Theory and Logic
Part 1 Module 2 Set operations, Venn diagrams
Introduction to Venn Diagrams SP This is a Venn diagram for two terms. We can conceive of every element of S as being within the boundary of the S circle.
Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
2.2 Statements, Connectives, and Quantifiers
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Testing Validity With Venn Diagrams
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Philosophy 103 Linguistics 103 Yet, still, Even further More and yet more, ad infinitum, Introductory Logic: Critical Thinking Dr. Robert Barnard.
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
Diagramming Universal-Particular arguments The simplest style of nontrivial argument is called a Universal-Particular argument. Earlier in Part 2 Module.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.3 Venn Diagrams and Set Operations.
Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 2.3, Slide 1 CHAPTER 2 Set Theory.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Venn Diagrams.
Section 3.5 More Set Operators and relationships.
 2012 Pearson Education, Inc. Slide Chapter 2 The Basic Concepts of Set Theory.
The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}
Chapter 2 Sets and Functions.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
The Language of Sets If S is a set, then
CHAPTER 2 Set Theory.
Unions and Intersections of Sets
Copyright © Zeph Grunschlag,
Venn Diagrams and Set Operation
SETS AND VENN DIAGRAMS.
Venn Diagrams and Subsets
Probability Vocabulary
CSNB 143 Discrete Mathematical Structures
Lecture 1 – Formal Logic.
Chapter 3 The Logic of Quantified Statements
Testing Validity With Venn Diagrams
Chapter 3: Introduction to Logic
Testing for Validity with Venn Diagrams
Today’s Topics Introduction to Predicate Logic Venn Diagrams
5 Categorical Syllogisms
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Section 2.3 Venn Diagrams and Set Operations
Part 1 Module 2 Set operations, Venn diagrams
Logics for Data and Knowledge Representation
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Diagramming Universal-Particular arguments
Chapter 7 Logic, Sets, and Counting
CHAPTER 2 Set Theory.
4 Categorical Propositions
Categorical propositions
Exercise 2x − 3 = 9 x = 6.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Thinking Mathematically
CHAPTER 2 Set Theory.
Thinking Mathematically
VENN DIAGRAMS By Felicia Wright
AND.
Logical and Rule-Based Reasoning Part I
CHAPTER 2 Set Theory.
Presentation transcript:

Logic In Part 2 Modules 1 through 5, our topic is symbolic logic. We will be studying the basic elements and forms that provide the structural foundations for critical reasoning. Symbolic logic is a topic that unites the sciences and the humanities. Researchers in logic may come from philosophy, mathematics, linguistics, or computer science, among other fields.

Statements in logic In logic, a statement or proposition is a declarative sentence that has truth value. When we say that a sentence has truth value, we mean that it makes sense to ask whether the sentence is true or false. “Today is Monday” is a statement. “1 + 1 = 3” is a statement.

Quantifiers and categorical statements In logic, terms like “all,” “some,” or “none” are called quantifiers. A statement based on a quantifier is called a quantified statement or categorical statement. “All bad hair days are catastrophes.” “No slugs are speedy.” “Some owls are hooty.” are examples of quantified or categorical statements.

Categories Quantified or categorical statements state a relationship between two or more classes of objects or categories. In the previous examples, bad hair days catastrophes slugs speedy (things) owls hooty (things) are all categories.

Existential statements A statement of the form “Some A are B” or “Some A aren’t B” asserts the existence of at least one element (in logic, “some” means “at least one”). Categorical statements having those forms are called existential statements. “Some owls are hooty” “Some wolverines are not cuddly” are examples of existential statements.

Existential statements “Some owls are hooty” asserts that there exists at least one thing that is both an owl and hooty. That is, the intersection of the categories “owls” and “hooty things” is not empty. We can convey that information by making a mark on a Venn diagram. We place an “X” in a region of a Venn diagram to indicate that that region must contain at least one element.

Diagramming existential statements

Diagramming existential statements The existential statement “Some wolverines are not cuddly” asserts that there must be at least one element who is a wolverine (W) but is not cuddly (C ).

Universal statements “All bad hair days are catastrophes” “No slugs are speedy” are examples of universal statements.

Universal negative statements A statement of the form “No A are B” is called universal negative. It asserts that there is no element in both category A and category B at the same time. In other words, “No A are B” asserts that categories A and B are disjoint, which means that the intersection of the two categories is empty. “No slugs are speedy” is a universal negative statement.

Diagramming universal negative statements In logic, we use shading to indicate that a certain region of a Venn diagram is empty (contains no elements). The universal negative statement “No slugs are speedy” asserts that the region of the diagram where “Slugs” and “Speedy things” intersect must be empty.

Diagramming universal negative statements

Universal positive statements A statement of the form “All A are B” is called universal positive . It asserts that there is no element in category A that isn’t also in category B. “All bad hair days are catastrophes” is an example of a universal positive statement.

Diagramming universal positive statements The universal positive statement “All bad hair days are catastrophes” asserts that it is impossible to be a bad hair day (B) without also being a catastrophe (C). This means that the region of the diagram that is inside B but outside C must be empty.

Diagramming universal positive statements

Interpreting Venn diagrams in logic We will use Venn diagrams (typically three-circle diagrams) to convey the information in propositions about relationships between various categories.

Shading means “nothing here…” In logic, when a region of a Venn diagram is shaded, this tells us that that region contains no elements. That is, a shaded region is empty. Suppose that we are presented with the marked Venn diagram shown below and on the following slides. We should be able to interpret the meaning of the marks on the diagram.

An “X” means “something is here…” In logic, when a region of a Venn diagram contains an “X”, this tells us that that region contains at least one element.

An “X” means “something is here…” In logic, when an “X”, appears on the border between two regions, this tells us that there is at least one element in the union of the two regions, but we are not certain whether the element(s) are in the first region, the second region, or both regions.

No marking means “uncertain…” In logic, when a region of the Venn diagram contains no markings, it is uncertain as to whether or not that region contains any elements.

Example Suppose we will use a three-circle Venn diagram to convey information about the relationships between these three categories: Angry apes (A); Blissful baboons (B); Churlish chimps (C). Select the diagram whose markings correspond to “No blissful baboons are angry apes.” Assume that we do not know of any other relationships between categories.

Solution Select the diagram whose markings correspond to “No B are A.” According to the proposition “No B are A,” it must be impossible for an element that is in category A to also be in category B. This means that the intersection of circles B and A must be empty (that is, shaded). This is what is shown in choice B below. The correct choice is B.

More exercises For tutorials on diagramming categorical propositions, see The DIAGRAMMER on our home page. http://www.math.fsu.edu/~wooland/diagrams/diagramming.html