GEB class notes jan 18 A Logic Puzzle Classification Problems, Equivalence Relations, and Disjoint Unions Logic and Set Theory.

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.
AE1APS Algorithmic Problem Solving John Drake. The island of Knights and Knaves is a fictional island to test peoples ability to reason logically. There.
Equivalence Relations
Possible World Semantics for Modal Logic
Discrete Mathematics I Lectures Chapter 6
Copyright © Cengage Learning. All rights reserved.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Instructor: Hayk Melikya
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
1 Chapter Equivalence, Order, and Inductive Proof.
The Engineering Design of Systems: Models and Methods
AE1APS Algorithmic Problem Solving John Drake.  Invariants – Chapter 2  River Crossing – Chapter 3  Logic Puzzles – Chapter 5 (13) ◦ Knights and Knaves.
CAS LX 502 Semantics 1b. The Truth Ch. 1.
Sets Definition of a Set: NAME = {list of elements or description of elements} i.e. B = {1,2,3} or C = {x  Z + | -4 < x < 4} Axiom of Extension: A set.
Operations on Sets Union Intersection: Two sets are disjoint if their intersection is the null set. Difference A - B. Complement of a set A.
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
Copyright © Zeph Grunschlag, Set Operations Zeph Grunschlag.
Chapter 4 Sets. A set is a well-defined collection of objects. There are two ways to define a set: (1) by listing all the members of the set, and (2)
1 Set Theory. 2 Set Properties Commutative Laws: Associative Laws: Distributive Laws:
Restricted Satisfiability (SAT) Problem
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Set Operations CS/APMA 202, Spring 2005 Rosen, section 1.7 Aaron Bloomfield.
Introduction to Computer Science. A Quick Puzzle Well-Formed Formula  any formula that is structurally correct  may be meaningless Axiom  A statement.
Fuzzy Logic Jan Jantzen Logic is based on set theory, and when we switch to fuzzy sets it will have an effect on.
Set Notation.
Equivalence Relations MSU CSE 260. Outline Introduction Equivalence Relations –Definition, Examples Equivalence Classes –Definition Equivalence Classes.
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
Chapter 3 – Set Theory  .
Sets Defined A set is an object defined as a collection of other distinct objects, known as elements of the set The elements of a set can be anything:
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
1 Set Theory Chapter 3. 2 Chapter 3 Set Theory 3.1 Sets and Subsets A well-defined collection of objects (the set of outstanding people, outstanding is.
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
Discrete Structure Sets. 2 Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element.
Language: Set of Strings
PHIL012 Class Notes 1/15/2001. Outline Announcements, web page Review Homework Problems (1-7) Set Theory Review & Problem 8 (if time) Assignment for Wednesday.
CS201: Data Structures and Discrete Mathematics I
Copyright © Cengage Learning. All rights reserved.
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
Set theory Neha Barve Lecturer Bioinformatics
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Set Theory Chapter 3. Chapter 3 Set Theory 3.1 Sets and Subsets A well-defined collection of objects (the set of outstanding people, outstanding is very.
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.
Reasoning about Knowledge 1 INF02511: Knowledge Engineering Reasoning about Knowledge (a very short introduction) Iyad Rahwan.
Chapter 2 With Question/Answer Animations. Section 2.1.
Thinking Mathematically Statements, Negations, and Quantified Statements.
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
Introduction to Sets and Logic
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
Basic probability Sep. 16, Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
1 Section 4.2 Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST).
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
MAT 2720 Discrete Mathematics Section 3.3 Relations
MA10209 – Week 3 Tutorial B3/B4, Andrew Kennedy. people.bath.ac.uk/aik22/ma10209 How to go about a proof  Step 1: Identify what you need to show  Sometimes.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
If-then statements April 4, What is an if-then statement? One of the postulates we looked at earlier stated: If B is between A and C, then AB +
DefinitionsTrue / False Postulates and Theorems Lines and Angles Proof.
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
“It is impossible to define every concept.” For example a “set” can not be defined. But Here are a list of things we shall simply assume about sets. A.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
The Relation Induced by a Partition
Copyright © Cengage Learning. All rights reserved.
Chapter 2 Sets and Functions.
Session – 2 SETS & Operations of SETS
Venn Diagrams and Partitions
L5 Set Operations.
Presentation transcript:

GEB class notes jan 18 A Logic Puzzle Classification Problems, Equivalence Relations, and Disjoint Unions Logic and Set Theory

Basic Question What hope is there that a certain “portion of reality can be imitated in its behavior by a set of meaningless symbols governed by formal rules”?

n I offer two prizes --- Prize 1 and Prize 2. You are to make a statement. If the statement is true, then I will give you one of the prizes (I’m not saying which one). If your statement is false, then you get no prize. Obviously you can be sure of winning a prize by saying, e.g., “Two plus two is four,” but suppose you have your heart set on Prize 1; what statement could you make that would guarantee that you will get Prize 1? n HINT: Try a statement of the form “You will not give me …”

Classification Problems n Statements can be self-referential, well-formed, true, provable, meaningful … n The Game of 20 Questions n The “… three of these things are kind of the same” Game

Set Complements A not A The Universe

A Partition of the Universe animal vegetable mineral other

A Partition by Overlapping Sets n How many disjoint subsets in this partition? A B

What does “kind of the same” mean? 3 essential properties n For every A, A “is kind of the same as” A. n If A “is kind of the same as” B, then B “is kind of the same as” A. n If A “is kind of the same as” B and B “is kind of the same as” C, then A “is kind of the same as” C

RESULT: n If a relation is symmetric, reflexive, and transitive, n Then the collection of sets of things that are “kind of the same” forms a partition of the Universe into a disjoint union.

DeMorgan’s Laws Sets: not(A  B) = not A  not B n In Logic, Not(A OR B) =(Not A) AND (Not B)

Summary: at a very basic level, n reality seems to be imitated by sets, n set operations seem to correspond to logical operations, n logical operations seem to correspond to thought processes, n thought processes seem to be well- expressed through the language of AND, OR, and NOT.

A Set Operation for If … Then …

Which Box Contains the Gold? n Two boxes are labeled "A" and "B". n A sign on box A says "The sign on box B is true and the gold is in box A". n A sign on box B says "The sign on box A is false and the gold is in box A". n Assuming there is gold in one of the boxes, which box contains the gold?

What’s Going On? n Your reasoning was sound. If each sign is either true or false, then the only interpretation that is logically consistent with those signs is “the gold is in Box B.” n Experimentally, we saw that the logically consistent interpretation was not consistent with reality --- who said it had to be?