IN A NUTSHELL : WHAT IS A VENN DIAGRAM?
|
|
- Simon Kennedy
- 5 years ago
- Views:
Transcription
1 For anyone who tries to Google anything today (August 4, 2014), you may notice that, according to Google, today is the 180 th birthday of the logician John Venn. Those who have taken a course in logic may be familiar with Venn diagrams. A Venn diagram is a diagram which is often used to provide a kind of intuitive understanding of categorical arguments. Much of the time Venn diagrams are used in the simple analysis of categorical syllogisms. Logic is of course the study of arguments. An argument is a group of statements in which at least one or more of those statements (called premises ) are used in such a way as to support a statement called a conclusion. A statement is a sentence which is either true or false. A syllogism is a category of deductive arguments, all of which consist of two premises and one conclusion. (Syllogism is derived from the Greek word syllogismos which means conclusion or inference.) Here is an example of a syllogism (BTW: formally known as Modus Ponens or the mode that puts ): A categorical syllogism is a category of all syllogisms in which all three statements are categorical propositions. A proposition is essentially the informational content of a statement. A categorical proposition is a category of statement which relates two classes or categories to each other: Here is an example of a categorical statement: Here is another example of a categorical statement: Both statements directly above involve the relation of two categories, that of philosophers and that of people. Here is an example of a categorical syllogism : Page 1 of 5
2 In a Venn diagram a category is represented by a circle. Inside the circle are all those things that belong in a particular category. Outside the circle are all those things which do NOT belong in the particular category. Here is an example of a category. Call this category people. The black X s represent people who are philosophers and the red X s represent all other people who are not philosophers. Here is an example of a Venn circle containing the members of the category people. Notice that both Socrates and General Douglas MacArthur are both included in the category called people. Now I m going to draw another circle to represent the category philosophers. Page 2 of 5
3 Notice that Socrates (the black X with an underline) is part of the group Philosophers. General Douglas MacArthur (the red X with an underline) is not a philosopher and therefore outside the group. Finally I ll draw a circle around a category I will call mortals. Notice that the category mortals also includes all of the category people. Both Socrates and General Douglas MacArthur are included in the category mortals. So when we combine all the Venn circles we come up with this: Page 3 of 5
4 Here are the various areas of a relatively simple Venn diagram for a categorical syllogism. All this is just the tip of the iceberg. Venn diagrams are a relatively easy way of evaluating whether a conclusion of an argument is a good one, without doing all the math and calculating. Venn diagrams can also be done for more complex arguments than syllogisms (remember a syllogism essentially has 3 statements; two premises and a conclusion). Theoretically there is no limit to the number of statements that can be included in a Venn diagram. On the next page is a Venn diagram encompassing 6 categories: Page 4 of 5
5 Source: Wikipedia, public domain (accessed 8/4/14) So here is a Venn diagram of an argument in the category of categorical syllogisms, in a nutshell of the category coconut shells. (I m not very good at drawing almonds, peanuts, acorns etc.) Page 5 of 5
Section 2.4: Arguments with Quantified Statements
Section 2.4: Arguments with Quantified Statements In this section, we shall generalize the ideas we developed in Section 1.3 to arguments which involve quantified statements. Most of the concepts we shall
More informationResolution (14A) Young W. Lim 6/14/14
Copyright (c) 2013-2014. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free
More informationLogic as a Programming Language
Logic as a Programming Language! Logic can be considered the oldest programming language! Aristotle invented propositional logic over 2000 years ago in order to prove properties of formal arguments! Propositions
More informationDeduction Rule System vs Production Rule System. Prof. Bob Berwick. Rules Rule
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2003 Recitation 2, September 11/12 Rules Rule Prof. Bob Berwick Agenda
More informationWhat is the study of logic?
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition What is the study of logic? Logic is the study of making inferences given a set of facts, we attempt
More informationAll logicians are millionaires. Gensler is a logician. Á Gensler is a millionaire.
All logicians are millionaires. Gensler is a logician. Á Gensler is a millionaire. all L is M g is L Á g is M Syllogistic logic (our first system) deals with such arguments; it uses capital and small letters
More informationSelf-reproducing programs. And Introduction to logic. COS 116: 3/6/2008 Sanjeev Arora
Self-reproducing programs. And Introduction to logic. COS 6: 3/6/28 Sanjeev Arora Discussion Time Did Theory of Everything article make you look at something in a new way? How does it connect to Tuesday
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More informationChapter 12. Computability Mechanizing Reasoning
Chapter 12 Computability Gödel s paper has reached me at last. I am very suspicious of it now but will have to swot up the Zermelo-van Neumann system a bit before I can put objections down in black & white.
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.4 Arguments with Quantified Statements Copyright Cengage Learning. All rights reserved. Arguments
More informationCS 320: Concepts of Programming Languages
CS 320: Concepts of Programming Languages Wayne Snyder Computer Science Department Boston University Lecture 03: Bare-Bones Haskell Continued: o Function Application = Rewriting by Pattern Matching o Haskell
More informationQuantification. Using the suggested notation, symbolize the statements expressed by the following sentences.
Quantification In this and subsequent chapters, we will develop a more formal system of dealing with categorical statements, one that will be much more flexible than traditional logic, allow a deeper analysis
More informationThe word zero has had a long and interesting history so far. The word comes
Worth 1000 Words Real Numbers and Their Properties Learning Goals In this lesson, you will: Classify numbers in the real number system. Understand the properties of real numbers. Key Terms real number
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.8 / 6.89 Great Ideas in Theoretical Computer Science Spring 28 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationCS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems
CS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems 1. Search trees for the state-space graph given below: We only show the search trees corresponding
More informationLecture 7: January 15, 2014
32002: AI (First order Predicate Logic, Syntax and Semantics) Spring 2014 Lecturer: K.R. Chowdhary Lecture 7: January 15, 2014 : Professor of CS (GF) Disclaimer: These notes have not been subjected to
More informationINTLOGS17 Test 1. Prof: S Bringsjord TA: Rini Palamittam NY
INTLOGS17 Test 1 Prof: S Bringsjord TA: Rini Palamittam 0306170626NY Immediate Action Items: Please now, before you do anything else, write down the following details on the Scantron sheets as well as
More informationChapter 1: Thinking Critically Lecture notes Math 1030 Section C
Section C.1: Sets and Venn Diagrams Definition of a set A set is a collection of objects and its objects are called members. Ex.1 Days of the week. Ex.2 Students in this class. Ex.3 Letters of the alphabet.
More informationReason with shapes and their attributes.
Grade 3 Geometry and Perimeter SDadfa;sdklfjas;Unit Overview Reason with shapes and their attributes. 1. Understand that shapes in different categories (e.g., rhombuses, rectangles, and others) may share
More informationA Brief Introduction to Truth-Table Logic. Kent Slinker Pima Community College
` A Brief Introduction to ruth-able Logic Kent Slinker Pima Community College Earlier in this class, we learned that all arguments are either valid or invalid. Additionally, we learned that certain valid
More informationIII SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT. Multiple Choice Questions
III SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT Multiple Choice Questions MODULE - I 1. In Symbolic logic, do not change their value. a) Variables
More informationKnowledge Representation
Knowledge Representation References Rich and Knight, Artificial Intelligence, 2nd ed. McGraw-Hill, 1991 Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Outline
More informationSAMLab Tip Sheet #1 Translating Mathematical Formulas Into Excel s Language
Translating Mathematical Formulas Into Excel s Language Introduction Microsoft Excel is a very powerful calculator; you can use it to compute a wide variety of mathematical expressions. Before exploring
More informationTHE PREDICATE CALCULUS
2 THE PREDICATE CALCULUS Slide 2.1 2.0 Introduction 2.1 The Propositional Calculus 2.2 The Predicate Calculus 2.3 Using Inference Rules to Produce Predicate Calculus Expressions 2.4 Application: A Logic-Based
More informationilogos is a freely-available, cross-platform tool that allows you to easily construct and share argument maps.
ilogos User Guide ilogos is a freely-available, cross-platform tool that allows you to easily construct and share argument maps. What is an argument? For our purposes an argument is a technical term that
More informationPart (04) Introduction to Programming
Part (04) Introduction to Programming Dr. Ahmed M. ElShafee 1 Dr. Ahmed ElShafee, ACU : Summer 2014, Introduction to CS 1 EVOLUTION To write a program for a computer, we must use a computer language. A
More informationTHE FOUNDATIONS OF MATHEMATICS
THE FOUNDATIONS OF MATHEMATICS By: Sterling McKay APRIL 21, 2014 LONE STAR - MONTGOMERY Mentor: William R. Brown, MBA Mckay 1 In mathematics, truth is arguably the most essential of its components. Suppose
More informationLambda Calculus and Type Inference
Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ August 17, 2007 Lambda Calculus and Type
More information6.034 Notes: Section 10.1
6.034 Notes: Section 10.1 Slide 10.1.1 A sentence written in conjunctive normal form looks like ((A or B or not C) and (B or D) and (not A) and (B or C)). Slide 10.1.2 Its outermost structure is a conjunction.
More informationIntroduction to Prolog
Introduction to Prolog David Woods dwoods@scss.tcd.ie Week 3 - HT Declarative Logic The Prolog programming language is, at its theoretical core, a declarative language. This is unlike more commonly used
More informationCSI30. Chapter 1. The Foundations: Logic and Proofs Rules of inference with quantifiers Logic and bit operations Specification consistency
Chapter 1. The Foundations: Logic and Proofs 1.13 Rules of inference with quantifiers Logic and bit operations Specification consistency 1.13 Rules of inference with quantifiers universal instantiation
More informationGTPS Curriculum Grade 6 Math
14 days 4.16A2 Demonstrate a sense of the relative magnitudes of numbers. 4.1.6.A.7 Develop and apply number theory concepts in problem solving situations. Primes, factors, multiples Common multiples,
More informationAn Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic
An Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic Rebeka Ferreira and Anthony Ferrucci 1 1 An Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic is
More information1. Logic as a subject matter is the study of logics, understood as models of acceptable inference patterns
Lecture 9: Propositional Logic I Philosophy 130 23 & 28 October 2014 O Rourke I. Administrative A. Problem sets due Thursday, 30 October B. Midterm course evaluations C. Questions? II. Logic and Form A.
More informationLambda Calculus and Type Inference
Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ October 13, 2004 Lambda Calculus and Type
More informationDepartment: Course: Chapter 1
Department: Course: 2016-2017 Term, Phrase, or Expression Simple Definition Chapter 1 Comprehension Support Point Line plane collinear coplanar A location in space. It does not have a size or shape The
More informationDesperately Seeking,..Information?
QuickBooks support from Diane Gilson... Desperately Seeking,..Information? One of the primary benefits of an accounting system is that you can store and categorize LOTS of information. On the other hand,..one
More informationMy dear students, Believe in yourselves. Believe in your abilities. You have got this! -Dr. M
1/20 2/10 3/7 4/18 5/10 6/6 7/17 8/12 Total/100 Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. You must show all work, or risk losing credit. Be
More informationGEOMETRY PRECISION GLEs
GEOMETRY PRECISION GLEs NUMBER AND NUMBER RELATIONS GLE.1 GLE.2 GLE.3 Simplify and determine the value of radical expressions Predict the effect of operations on real numbers (e.g., the quotient of a positive
More informationThe Intersection of Two Sets
Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which
More informationGrade 7/8 Math Circles Fall November 6/7/8 Boolean Logic
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 28 - November 6/7/8 Boolean Logic Logic is everywhere in our daily lives. We
More informationThe simplest notion of a list matching a pattern is when the pattern is exactly the same as the list. The list certainly matches the pattern but doesn
Pattern Matching Its Use Project P1 of Common Lisp: An Interactive Approach Stuart C. Shapiro Department of Computer Science State University of New York at Bualo August 3, 1999 The goal of this project
More informationITCS 6150 Intelligent Systems. Lecture 13 First-Order Logic Chapter 8
ITCS 6150 Intelligent Systems Lecture 13 First-Order Logic Chapter 8 First-order logic We saw how propositional logic can create intelligent behavior But propositional logic is a poor representation for
More information4-1 Reasoning and Proof in Geometry
4-1 Reasoning and Proof in Geometry Inductive reasoning Deductive reasoning onditional statement We can use symbols to represent our statements: if p, then p p implies p only if, if p hypothesis conclusion
More informationSYMMETRY v.1 (square)
Symmetry with Code - v1 George Gadanidis 2017 researchideas.ca/sym 1 SYMMETRY v.1 (square) What is symmetry? I can t remember. Help! SQUARE PUZZLE My teacher loves puzzles I do too! Here is the latest
More informationThomas Jefferson High School for Science and Technology Program of Studies TJ Math 1
Course Description: This course is designed for students who have successfully completed the standards for Honors Algebra I. Students will study geometric topics in depth, with a focus on building critical
More informationMIT AITI Python Software Development
MIT AITI Python Software Development PYTHON L02: In this lab we practice all that we have learned on variables (lack of types), naming conventions, numeric types and coercion, strings, booleans, operator
More informationNotes for Chapter 12 Logic Programming. The AI War Basic Concepts of Logic Programming Prolog Review questions
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions The AI War How machines should learn: inductive or deductive? Deductive: Expert => rules =>
More informationProofs are Programs. Prof. Clarkson Fall Today s music: Proof by Paul Simon
Proofs are Programs Prof. Clarkson Fall 2017 Today s music: Proof by Paul Simon Review Previously in 3110: Functional programming in Coq Logic in Coq Today: A fundamental idea that goes by many names...
More informationFirst-Order Logic (FOL)
First-Order Logic (FOL) FOL consists of the following parts: Objects/terms Quantified variables Predicates Logical connectives Implication Objects/Terms FOL is a formal system that allows us to reason
More informationGrad AI Fall, 2007 Homework 1
Grad AI. 15-780 Fall, 2007 Homework 1 Homework deadline: 10:30am on October 4 Please print your code and hand it in with the hard copy of your homework. Also send a copy of your code by e-mail to both
More informationCPSC 121 Midterm 1 Friday October 14th, Signature: Section (circle one): 11:00 15:30 17:00
CPSC 121 Midterm 1 Friday October 14th, 2016 Name: Student ID: Signature: Section (circle one): 11:00 15:30 17:00 You have 70 minutes to write the 9 questions on this examination. A total of 60 marks are
More informationArtificial Intelligence Notes Lecture : Propositional Logic and Inference
Page 1 of 7 Introduction Artificial Intelligence Notes Lecture : Propositional Logic and Inference Logic is a natural bridge between man and machine. This is because: Logic is well-defined, which makes
More informationGrade 6 Math Circles November 6 & Relations, Functions, and Morphisms
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Relations Let s talk about relations! Grade 6 Math Circles November 6 & 7 2018 Relations, Functions, and
More informationNotes on Principia Mathematica
Notes on Principia Mathematica M. Randall Holmes November 5, 2014 These are my notes toward an interpretation of the Principia Mathematica of Russell and Whitehead (hereinafter PM ). Manners forbid saying
More informationHeterogeneous Reasoning
Heterogeneous Reasoning Stanford University The Openproof Project Developing software for logic education since 1984 Tarski s World The Language of First-order Logic Turing s World Hyperproof LPL: Fitch,
More informationDinwiddie County Public Schools Subject: Math 7 Scope and Sequence
Dinwiddie County Public Schools Subject: Math 7 Scope and Sequence GRADE: 7 Year - 2013-2014 9 WKS Topics Targeted SOLS Days Taught Essential Skills 1 ARI Testing 1 1 PreTest 1 1 Quadrilaterals 7.7 4 The
More informationPropositional logic (Ch. 7)
Propositional logic (Ch. 7) Announcements Writing 3 due Sunday - ideally use for project - if you haven't decided project by then, you will have to redo this work Logic: definitions We say that two sentences
More informationVenn s Diagrams: Maximum sets drawing
Venn s Diagrams: Maximum sets drawing Aureny Magaly Uc Miam 01107794@academ01.ccm.itesm.mx ITESM Campus Ciudad de México ABSTRACT In this paper, I tried to describe the maximum number of sets which can
More informationPlease try all of the TRY THIS problems throughout this document. When done, do the following:
AP Computer Science Summer Assignment Dr. Rabadi-Room 1315 New Rochelle High School nrabadi@nredlearn.org One great resource for any course is YouTube. Please watch videos to help you with any of the summer
More informationChapter 9 Deductive Arguments II Truth-Functional Logic. Tutorial: Truth Tables
Chapter 9 Deductive Arguments II ruth-unctional Logic utorial: ruth ables ruth ables he aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments.
More informationMathematics for Computer Scientists 2 (G52MC2)
Mathematics for Computer Scientists 2 (G52MC2) L07 : Operations on sets School of Computer Science University of Nottingham October 29, 2009 Enumerations We construct finite sets by enumerating a list
More informationGrade 7/8 Math Circles Fall November 6/7/8 Boolean Logic
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 28 - November 6/7/8 Boolean Logic Logic is everywhere in our daily lives. We
More informationTuesday, November 5, 2013 Name: Per:
Learning Objective Tuesday, November 5, 01 Name: Per: We will solve and interpret 1 problems using a Venn Diagram and set theory. Activate Prior Knowledge If we look at the following set of numbers 1-0,
More informationHands-on: Using ArcGIS and QGIS. GIS Mapping for Linguistic Research Jennifer Cramer University of Kentucky
Hands-on: Using ArcGIS and QGIS GIS Mapping for Linguistic Research Jennifer Cramer University of Kentucky Hands on! I think last week went well! Like last week, I ll do a quick run through of the assignment,
More informationDeclarative Programming. 2: theoretical backgrounds
Declarative Programming 2: theoretical backgrounds 1 Logic Systems: structure and meta-theoretical properties logic system syntax semantics proof theory defines which sentences are legal in the logical
More informationNote: For #10 I have written out the solutions in more detail than you would be required to give.
Math 218 Spring 2010 Homework 4 Solutions Section 1.5 Note: For #10 I have written out the solutions in more detail than you would be required to give. 10) For each of these sets of premises, what relevant
More informationRevisiting Kalmar completeness metaproof
Revisiting Kalmar completeness metaproof Angélica Olvera Badillo 1 Universidad de las Américas, Sta. Catarina Mártir, Cholula, Puebla, 72820 México angelica.olverabo@udlap.mx Abstract In this paper, I
More informationSection 4.1 Review of Quadratic Functions and Graphs (3 Days)
Integrated Math 3 Name What can you remember before Chapter 4? Section 4.1 Review of Quadratic Functions and Graphs (3 Days) I can determine the vertex of a parabola and generate its graph given a quadratic
More informationIntro to Programming. Unit 7. What is Programming? What is Programming? Intro to Programming
Intro to Programming Unit 7 Intro to Programming 1 What is Programming? 1. Programming Languages 2. Markup vs. Programming 1. Introduction 2. Print Statement 3. Strings 4. Types and Values 5. Math Externals
More informationMost of the class will focus on if/else statements and the logical statements ("conditionals") that are used to build them. Then I'll go over a few
With notes! 1 Most of the class will focus on if/else statements and the logical statements ("conditionals") that are used to build them. Then I'll go over a few useful functions (some built into standard
More informationFirst Order Predicate Logic CIS 32
First Order Predicate Logic CIS 32 Functionalia Demos? HW 3 is out on the web-page. Today: Predicate Logic Constructing the Logical Agent Predicate Logic First-order predicate logic More expressive than
More informationSET AND VENN DIAGRAMS
SET AND VENN DIAGRAMS Part 1: Relationship among sets Sets: A set is a of the set. Examples of a set:. An individual object in a set is called a Venn diagrams: A Venn diagram is a to the relationships
More informationChapter 4. Formalizing rules: a comparative survey. 1 Rules in argumentation
Chapter 4 Formalizing rules: a comparative survey In the chapters 2 and 3, we have described our approach to formalizing rules: Reason-Based Logic. In this chapter, we discuss a number of other approaches,
More informationAdvanced Logic and Functional Programming
Advanced Logic and Functional Programming Lecture 1: Programming paradigms. Declarative programming. From first-order logic to Logic Programming. Programming paradigms Programming paradigm (software engineering)
More informationClass 8 - September 13 Indirect Truth Tables for Invalidity and Inconsistency ( 6.5)
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 8 - September 13 Indirect Truth Tables for Invalidity and
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More informationPractice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.
CSE 240, Fall, 2013 Homework 2 Due, Tuesday September 17. Can turn in class, at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Consider
More informationInequalities and you 3
Inequalities and you 3 NAME: This worksheet will provide practice for solving absolute value, polynomial, and rational inequalities. We will also work on understanding why the procedures work. We will
More informationThe Real Number System
The Real Number System Pi is probably one of the most famous numbers in all of history. As a decimal, it goes on and on forever without repeating. Mathematicians have already calculated trillions of the
More informationCS 416, Artificial Intelligence Midterm Examination Fall 2004
CS 416, Artificial Intelligence Midterm Examination Fall 2004 Name: This is a closed book, closed note exam. All questions and subquestions are equally weighted. Introductory Material 1) True or False:
More information(QiuXin Hui) 7.2 Given the following, can you prove that the unicorn is mythical? How about magical? Horned? Decide what you think the right answer
(QiuXin Hui) 7.2 Given the following, can you prove that the unicorn is mythical? How about magical? Horned? Decide what you think the right answer is yourself, then show how to get the answer using both
More informationSolutions to Selected Exercises
Chapter 1 Solutions to Selected Exercises Section 1.1 2. {2, 4} 3. {7, 10} 5. {2, 3, 5, 6, 8, 9} 6. {1, 3, 5, 7, 9, 10} 8. A 9. 11. B 12. {1, 4} 14. {1} 15. {2, 3, 4, 5, 6, 7, 8, 9, 10} 18. 1 19. 3 22.
More informationLECTURE 11: ARGUMENTATION. An Introduction to Multiagent Systems CISC 7412, Fall 2011
LECTURE 11: ARGUMENTATION CISC 7412, Fall 2011 Today Last week we looked at negotiation. Mechanisms for getting agents to decide how to divide resources. This week we ll look at another approach to agreement.
More informationCS150 Sample Final. Name: Section: A / B
CS150 Sample Final Name: Section: A / B Date: Start time: End time: Honor Code: Signature: This exam is closed book, closed notes, closed computer, closed calculator, etc. You may only use (1) the final
More informationLecture 4: January 12, 2015
32002: AI (First Order Predicate Logic, Interpretation and Inferences) Spring 2015 Lecturer: K.R. Chowdhary Lecture 4: January 12, 2015 : Professor of CS (VF) Disclaimer: These notes have not been subjected
More informationInherence and Nonsubstantial Particulars: An Object-Oriented View Samuel H. Kenyon
Inherence and Nonsubstantial Particulars: An Object-Oriented View Samuel H. Kenyon 09/29/04 Kenyon 2 Introduction In order to tackle the meanings, assumptions, and inconsistencies in Aristotle s Categories[1],
More informationCSE 311: Foundations of Computing. Lecture 8: Predicate Logic Proofs
CSE 311: Foundations of Computing Lecture 8: Predicate Logic Proofs Last class: Propositional Inference Rules Two inference rules per binary connective, one to eliminate it and one to introduce it Elim
More informationDescribe Plane Shapes
Lesson 12.1 Describe Plane Shapes You can use math words to describe plane shapes. point an exact position or location line endpoints line segment ray a straight path that goes in two directions without
More informationMath 6 Midterm Review Solutions
Math Midterm Review Solutions 1. a statement b not a statement truth or falsity depends on the reference for the pronoun she c statement d not a statement truth or falsity depends on the reference for
More informationContext-Free Grammars
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 3, 2012 (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b. N is a
More informationProofs are Programs. Prof. Clarkson Fall Today s music: Two Sides to Every Story by Dyan Cannon and Willie Nelson
Proofs are Programs Prof. Clarkson Fall 2016 Today s music: Two Sides to Every Story by Dyan Cannon and Willie Nelson Review Currently in 3110: Advanced topics Futures Monads Today: An idea that goes by
More informationER Modeling Data Modeling and the Entity-Relationship (ER) Diagram Pg 1
ER Modeling Data Modeling and the Entity-Relationship (ER) Diagram Pg 1 Data Modeling and the Entity-Relationship (ER) Diagram Ray Lockwood Points: The Entity-Relationship (ER) Diagram is seen by various
More informationA cipher is a type of secret code, where you swap the letters around so that noone can read your message.
Secret Messages Introduction: In this project, you ll learn how to make your own encryption program, to send and receive secret messages with a friend. This project ties in with the Earth to Principa activity
More informationKnowledge Representation. What is knowledge representation?
Knowledge Representation What is knowledge representation? Structured knowledge base Search and inference algorithms 1 Examples of knowledge representation in AI Logic for general reasoning Expert systems
More informationQuestion about Final Exam. CS 416 Artificial Intelligence. What do we like about propositional logic? First-order logic
Page 1 Question about Final Exam CS 416 Artificial Intelligence I will have a date for you by Tuesday of next week. Lecture 13 First-Order Logic Chapter 8 First-order logic We saw how propositional logic
More informationfor all x, the assertion P(x) is false. there exists x, for which the assertion P(x) is true.
You can t prove a predicate is true because a predicate is not an assertion, you can t prove it is valid as it is not a deduction! If someone asks you to prove P(x), it is not totally clear what they mean.
More informationCITS5501 Software Testing and Quality Assurance Formal methods
CITS5501 Software Testing and Quality Assurance Formal methods Unit coordinator: Arran Stewart May 1, 2018 1 / 49 Sources Pressman, R., Software Engineering: A Practitioner s Approach, McGraw-Hill, 2005
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More information