Introduction to Predicate Calculus
|
|
- Marilynn Owens
- 7 years ago
- Views:
Transcription
1 Introduction to Predicate Calculus 1 Motivation Last time, we discuss the need for a representation language that was declarative, expressively adequate, unambiguous, context-independent, and compositional. We looked to logic for help. A logic has a language and an inference procedure. A language in turn has a synta which includes a vocabulary and a set of connectives. A language also has a semantics: We get to say what the ordinary vocabulary symbols mean, but the connectives has a fixed, truth-conditional meaning. (In some traditions, truth conditions is taken to be the same thing as meaning. This can be generalized to conditions of satisfaction for things other than statements. This seems to be a very limited theory of meaning, though.) Our first logic was propositional calculus. This has symbols (denoting propositions), some logical connectives (usually (or), (and), (not), and (implies)). Sentences are either symbols or sentences joined by logical connectives. The inference procedure is usually just modus ponens. Keep in mind that logic doesn't do anything: A proof theory tells us what a valid inference is, but it doesn't tell us which ones to make when. A problem with propositional calculus, we said, is that if isn't expressive enough. For example, suppose we want to capture the knowledge that Anyone standing in the rain will get wet. and then use this knowledge. For example, suppose we also learn that Jan is standing in the rain. We'd like to conclude that Jan will get wet. But each of these sentences would just be a represented by some proposition, say P, Q and R. What relationship is there between these propositions? Yes we can say P Q R Then, given P Q, we could indeed conclude R. But now, suppose we were told Pat is standing in the rain. We'd like to be able to conclude that Pat will get wet, but nothing we have stated so far will help us do this. The problem, it seems, is that we aren't able to represent any of the details of these propositions. It's the internal structure of these propositions that make the reasoning valid. But in propositional calculus we don't have anything else to talk about besides propositions!
2 2 Predicate Calculus Thus, even for very simply kinds of reasoning, we'd like a richer logic. The first thing we need to think about is what kinds of things there are in the world to talk about. We make a basic dichotomy: Things (or entities or objects, or what have you). This category includes people, numbers, unicorns, actions, events, places,... We'll call these objects. Things you can be said about things. This includes large, larger than, are brother and sister, squeamish, above, Republican, cost... We'll call these relations. Note that: You might think it is funny to call something like large a relation, since it's not relating anything to anything else. Instead, it seems more natural to call such things properties. We'll simply consider a property a kind of degenerate relation. Semantically, we'll usually talk about relations (and properties, of course) in terms of sets. E.g., large is supposed to be the set of large things; above is the set of ordered pairs of things that are above other things. This is a strange way of thinking about the world, and indeed, there are all sorts of problems with it, but it'll do for now. Exactly what goes where is up to you. For example, we might decide that colors, e.g., red, white and blue are properties. On the other hand, we could also think of them as objects: Then we might have a property being a color and a relation is the color that apply to color objects. Or maybe there are color objects and color properties. These issues aren't generally thought of as issues of logic so much as issues of ontology. A lot of knowledge representation is about exactly such decisions. If something is a relationship, does that mean it is not an object? Why would we care? Well, one implication is whether we can say things about them. More on this later. We can confuse this clear picture a little by introducing functions. A function is just a relation in which we can specify n-1 members of a tuple can guarantee that there is only one tuple with those members. For example, we might have a relation mother which lists all tuples pair a mother and child. Since there is (presumabl just one mother, the relation is a function from the point of view of the child element of the tuple, but of course, not from the point of view of the mother. 3 Syntax Okay, so that's what there is in the universe, more or less. What's our language? Symbols - Object symbols, e.g., John1, x. - - Predicate symbols, e.g, Tall, >, Cost. Note that predicates have an arity, i.e., something is a predicate of some fixed number of arguments. - - Function symbols. These look pretty much like predicates, and indeed, they have an arity.
3 Each of these guys comes in two flavors, a constant and a variable. For the time being, though, we'll only worry about variables for objects, and assume that all predicate and functions symbols are constants. Terms A term is either a symbol, or a functional expression (or function application). A functional expression is a function symbol and a bunch of terms. (Intuitively, the functions is applied to the terms. But remember that the functions here don't do anything; they just denote. Also, it is most common to write the function symbol, followed by all the arguments in parenthesis. So, for example, we might have Mother-of(Jan) Age-of(Jan) Age-of(Mother-of(Jan)) Arctan(π) +(2,3) In LISP-style we write: (Mother-of Jan) (Arctan π) but this is just syntax. You can think about a term as a possibly complex name. Sentences -- Terms are combined into sentences, or well-formed formulas. We can think of sentences as asserting things, i.e., they can have a truth value. There are several kinds: - Atomic sentences (atoms): A relation and some terms. Brothers(John,Bill) Republican(Bush) <(2,3) +-rel(2,3,5) Brothers(Father-of(Jan),Lou) (Note: Sometimes we take liberties with the syntax and write certain predicates using in-fix notation: 2<3 Joe=MrSmith Of course, this isn't true for LISP-style notation.) - Logical sentences: Logical combinations of other sentences, with the usual logical connectives. Brothers(Pat,Sue) <(2,3) +-rel(2,3,5) Brothers(Pat,Sue) <(2,3) Removed(Clinton) (Uncle(RW,monkey1) \& Monkey(monkey1)) Brothers(John,Bill) Brothers(Bill,John) Variables are allowed to appear in any of these. For example, it is perfectly okay to say Brothers(John,x)
4 Intuitively, we don't know whether this is true of false until we find out what x is supposed to be. (This is a semantic issue -- more on this later.) - Quantified sentences: We introduce quantifiers, which are things that help us interpret variables. Usually, there are two kinds, existential and universal. We stick these in front of another sentence: x (<(2) <(3)) x (Brothers(John,x)) Quantifiers have a scope. For example, consider the logical sentence x (Brothers(John,x)) x (Uncle(John,x)) The two different x's have nothing to do with each other. If a variable is enclosed with a quantifier, it is bound; otherwise, it is free. Quantifiers apply only to otherwise free variables. I.e., even if I changed the parentheses above, that won't effect the way we interpret the variables in the sentence (although it would be more confusing). Scope becomes more interesting when we build up more interesting, more complex sentences: x y (Brothers((Father-of()) Uncle( Note that here, it wouldn't make any difference if we put the y on the outside. So it was okay not to bother with parentheses. But in general, this isn't true: x y (Loves() Everybody loves somebody. y x (Loves() There's somebody who everyone loves. In general, order doesn't make any difference in a series of the same quantifier, but it matters a lot where the quantifiers change. A sentence with no free variables is a closed sentence; a sentence with no variables at all is a ground sentence. We will only allow quantification over objects, not over functions and predicates. A language with this restriction is called a first-order language. For example, the following sentence seems to require quantification over predicates: Everything that applied to Russia under the Czars applied to Russia under the Communists. Why not allow more expressiveness? Certain nice formal properties that FOPC has isn't shared by second order languages. More on this latter. Some things to think about: If we write Brothers(John,Bill), is it automatically follow that Brothers(Bill,John)?
5 What other kinds of quantifiers might there be? (Generalized quantifiers, e.g.: just about everyone, most ) 4 Semantics But what do any of these things mean? We can be more formal about this, but, intuitively, we define an interpretation as follows: A Universe of Discourse with objects, relations, and functions A mapping of constants to these elements We can interpret terms in the obvious way, given an interpretation: They denote the unique object described by the function. For example, if Father-of is the FATHER function, and Neil is some person and in the FATHER function, it says that GEORGE is in this relation to NEIL, then Father-of(Neil) denotes or designates GEORGE. We say that a sentence is satisfied, under an interpretation, if the sentence is true relative to the interpretation, i.e., it corresponds to something true in our universe of discourse. It is easy to see what to do with ground sentences (sentences with no variables). We can build up a recursive definition: An atomic formula is true if the specified relation holds; logical sentences are true as a truth-theoretical function of their parts. (There is a special case, though. There is a relation called equality that syntactically looks like any other relation. However, it is interpretated as true if the two terms asserted to be equal designate the same element of the universe.) But what about those quantifiers? We'll need another function, called a variable assignment, that maps variables to constants in the universe. For sentences with open variables, it only makes sense to ask if they are satisfied (in a given interpretation) with a particular variable assignment. For variables in the scope of a quantifier, though, we can specify more useful rules: For a universally quantified sentence, the sentence is satisfied if the enclosed sentence is true for all variable assignments. For an existentially quantified sentence, the sentence is satisfied if the enclosed sentence is true for some variable assignment. If an interpretation satisfies a sentence for all variable assignments, then it is called a model. (This is equivalent to treating free variables as if they were universally quantified.) A sentence is satisfiable if and only if there is some interpretation that satisfies it.
6 A sentence is valid if and only if all interpretations satisfy it. (I.e., it is a tautology.) A sentence is unsatisfiable if and only if there are no interpretations that satisfy it. These are out and out internal contradictions; i.e., they have inconsistent subparts. Some examples: x y >(y,x) is satisfied by some interpretation, not by others. x P(x) x P(x) happens to be true in all interpretations. x x=x For example, the sentence x Loves(Jan) is satisfied by an interpretation in which, say, all the individuals are {LYNN,JAN}, and LOVES is the relation {<LYNN,JAN>,<JAN,JAN>}, and Jan is mapped to JAN and Loves is mapped to LOVES (but not, say, in the model where Jan is mapped to LYNN). Another example: x(p(x) (F(x) = G(F(H(x))))) Here's an interpretation: Domain is the natural numbers H(x) is the predecessor function (i.e., it subtracts 1) G( be the product function P(x) is the predicate >0 F(x) is?? (factorial!) Alternatively, suppose Domain is all lists H(x) is CDR G( APPEND to the second argument the (list of the) head of the first P(x) is the predicate non-nil F(x) is REVERSE That is, the equation states that for every list if x not equal to nil then REVERSE(x)=APPEND-HEAD-TO- SECOND(REVERSE(CDR(x)))
7 Note that we have not yet specified how we reason with this language. First, let us look at how we might represent things in it. 5 Advantages Over Propositional Calculus Let s see have predicate calculus helps. Instead of just propositions, we can make very general statements, such as the following: y( Clear( x) y, z( z) y( Block( Move( Table) Table) Block( Clear( x) Clear( Move( Clear( ) ) z)) So, the advantage here is that we have a much smaller representation. Note, also, that we don t have to add any rules if we just add another block, say. Our representation doesn t grow much as the problem gets bigger.
2. The Language of First-order Logic
2. The Language of First-order Logic KR & R Brachman & Levesque 2005 17 Declarative language Before building system before there can be learning, reasoning, planning, explanation... need to be able to
More informationPredicate Logic. For example, consider the following argument:
Predicate Logic The analysis of compound statements covers key aspects of human reasoning but does not capture many important, and common, instances of reasoning that are also logically valid. For example,
More informationPredicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.
Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is
More informationInvalidity in Predicate Logic
Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional
More informationRelational Calculus. Module 3, Lecture 2. Database Management Systems, R. Ramakrishnan 1
Relational Calculus Module 3, Lecture 2 Database Management Systems, R. Ramakrishnan 1 Relational Calculus Comes in two flavours: Tuple relational calculus (TRC) and Domain relational calculus (DRC). Calculus
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationLikewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationThe Refutation of Relativism
The Refutation of Relativism There are many different versions of relativism: ethical relativism conceptual relativism, and epistemic relativism are three. In this paper, I will be concerned with only
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationAlgebra I Notes Relations and Functions Unit 03a
OBJECTIVES: F.IF.A.1 Understand the concept of a function and use function notation. Understand that a function from one set (called the domain) to another set (called the range) assigns to each element
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationPropositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.
irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto
More informationThe Syntax of Predicate Logic
The Syntax of Predicate Logic LX 502 Semantics I October 11, 2008 1. Below the Sentence-Level In Propositional Logic, atomic propositions correspond to simple sentences in the object language. Since atomic
More information(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationHow To Proofread
GRADE 8 English Language Arts Proofreading: Lesson 6 Read aloud to the students the material that is printed in boldface type inside the boxes. Information in regular type inside the boxes and all information
More informationBasic Set Theory. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX 502 - Semantics I September 11, 2008
Basic Set Theory LX 502 - Semantics I September 11, 2008 1. Motivation When you start reading these notes, the first thing you should be asking yourselves is What is Set Theory and why is it relevant?
More informationIndependent samples t-test. Dr. Tom Pierce Radford University
Independent samples t-test Dr. Tom Pierce Radford University The logic behind drawing causal conclusions from experiments The sampling distribution of the difference between means The standard error of
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationLecture 13 of 41. More Propositional and Predicate Logic
Lecture 13 of 41 More Propositional and Predicate Logic Monday, 20 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Sections 8.1-8.3, Russell and Norvig
More informationChapter 7. Functions and onto. 7.1 Functions
Chapter 7 Functions and onto This chapter covers functions, including function composition and what it means for a function to be onto. In the process, we ll see what happens when two dissimilar quantifiers
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationMath 223 Abstract Algebra Lecture Notes
Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course
More informationRigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
More informationA Few Basics of Probability
A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study
More informationAn Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number
More informationFirst-order logic. Chapter 8. Chapter 8 1
First-order logic Chapter 8 Chapter 8 1 Outline Why FOL? Syntax and semantics of FOL Fun with sentences Wumpus world in FOL Chapter 8 2 Pros and cons of propositional logic Propositional logic is declarative:
More information7 Relations and Functions
7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,
More informationCHAPTER 7 ARGUMENTS WITH DEFIITIONAL AND MISSING PREMISES
CHAPTER 7 ARGUMENTS WITH DEFIITIONAL AND MISSING PREMISES What You ll Learn in this Chapter In Chapters -5, we developed a skill set that s sufficient for the recognition, analysis, evaluation and construction
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationML for the Working Programmer
ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming
More informationPredicate Logic Review
Predicate Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Grammar A term is an individual constant or a variable. An individual constant is a lowercase letter from the beginning
More informationRegions in a circle. 7 points 57 regions
Regions in a circle 1 point 1 region points regions 3 points 4 regions 4 points 8 regions 5 points 16 regions The question is, what is the next picture? How many regions will 6 points give? There's an
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationLecture 1. Basic Concepts of Set Theory, Functions and Relations
September 7, 2005 p. 1 Lecture 1. Basic Concepts of Set Theory, Functions and Relations 0. Preliminaries...1 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2
More informationInstructor (Brad Osgood)
TheFourierTransformAndItsApplications-Lecture08 Instructor (Brad Osgood):We're on? Okay. So today first of all, any questions? Anything on anybody's mind? If you brought your problem sets with you, you
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationRules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05
Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example Re-Revisited Our Old Example: Suppose we have: All human beings
More informationON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 2012 1 p. 43 48 ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS I nf or m at i cs L. A. HAYKAZYAN * Chair of Programming and Information
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationSolutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1
Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1 Prof S Bringsjord 0317161200NY Contents I Problems 1 II Solutions 3 Solution to Q1 3 Solutions to Q3 4 Solutions to Q4.(a) (i) 4 Solution to Q4.(a)........................................
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationThe theory of the six stages of learning with integers (Published in Mathematics in Schools, Volume 29, Number 2, March 2000) Stage 1
The theory of the six stages of learning with integers (Published in Mathematics in Schools, Volume 29, Number 2, March 2000) Stage 1 Free interaction In the case of the study of integers, this first stage
More informationChapter 1. Use the following to answer questions 1-5: In the questions below determine whether the proposition is TRUE or FALSE
Use the following to answer questions 1-5: Chapter 1 In the questions below determine whether the proposition is TRUE or FALSE 1. 1 + 1 = 3 if and only if 2 + 2 = 3. 2. If it is raining, then it is raining.
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More information(Refer Slide Time: 2:03)
Control Engineering Prof. Madan Gopal Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 11 Models of Industrial Control Devices and Systems (Contd.) Last time we were
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More information5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
More informationPredicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering
Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24
More informationMultiplication Rules! Tips to help your child learn their times tables
Multiplication Rules! Tips to help your child learn their times tables 1. Have fun! We want relaxed kids and plenty of giggles. 2. Go slowly and relax. 3. Do the preliminary review, all the preliminary
More informationSchedule. Logic (master program) Literature & Online Material. gic. Time and Place. Literature. Exercises & Exam. Online Material
OLC mputational gic Schedule Time and Place Thursday, 8:15 9:45, HS E Logic (master program) Georg Moser Institute of Computer Science @ UIBK week 1 October 2 week 8 November 20 week 2 October 9 week 9
More informationSentence Semantics. General Linguistics Jennifer Spenader, February 2006 (Most slides: Petra Hendriks)
Sentence Semantics General Linguistics Jennifer Spenader, February 2006 (Most slides: Petra Hendriks) Data to be analyzed (1) Maria slaapt. (2) Jan slaapt. (3) Maria slaapt en Jan slaapt. (4) Iedereen
More informationCS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-cs510-se
More informationFormalization of the CRM: Initial Thoughts
Formalization of the CRM: Initial Thoughts Carlo Meghini Istituto di Scienza e Tecnologie della Informazione Consiglio Nazionale delle Ricerche Pisa CRM SIG Meeting Iraklio, October 1st, 2014 Outline Overture:
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More informationIf an English sentence is ambiguous, it may allow for more than one adequate transcription.
Transcription from English to Predicate Logic General Principles of Transcription In transcribing an English sentence into Predicate Logic, some general principles apply. A transcription guide must be
More informationBut have you ever wondered how to create your own website?
Foreword We live in a time when websites have become part of our everyday lives, replacing newspapers and books, and offering users a whole range of new opportunities. You probably visit at least a few
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationA Beginner s Guide to Modern Set Theory
A Beginner s Guide to Modern Set Theory Martin Dowd Product of Hyperon Software PO Box 4161 Costa Mesa, CA 92628 www.hyperonsoft.com Copyright c 2010 by Martin Dowd 1. Introduction..... 1 2. Formal logic......
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More information>> My name is Danielle Anguiano and I am a tutor of the Writing Center which is just outside these doors within the Student Learning Center.
>> My name is Danielle Anguiano and I am a tutor of the Writing Center which is just outside these doors within the Student Learning Center. Have any of you been to the Writing Center before? A couple
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationBasic Concepts of Set Theory, Functions and Relations
March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2 1.3. Identity and cardinality...3
More informationWriting Thesis Defense Papers
Writing Thesis Defense Papers The point of these papers is for you to explain and defend a thesis of your own critically analyzing the reasoning offered in support of a claim made by one of the philosophers
More informationFormal Logic, Algorithms, and Incompleteness! Robert Stengel! Robotics and Intelligent Systems MAE 345, Princeton University, 2015
Formal Logic, Algorithms, and Incompleteness! Robert Stengel! Robotics and Intelligent Systems MAE 345, Princeton University, 2015 Learning Objectives!! Principles of axiomatic systems and formal logic!!
More information[Refer Slide Time: 05:10]
Principles of Programming Languages Prof: S. Arun Kumar Department of Computer Science and Engineering Indian Institute of Technology Delhi Lecture no 7 Lecture Title: Syntactic Classes Welcome to lecture
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationAppendix 1: Adaptable Email Templates
Appendix 1: Adaptable Email Templates The following emails are included for the benefit of anybody running a similar project. They are provided as templates, so that you don t need to start all of your
More informationSolving Rational Equations
Lesson M Lesson : Student Outcomes Students solve rational equations, monitoring for the creation of extraneous solutions. Lesson Notes In the preceding lessons, students learned to add, subtract, multiply,
More informationBBC LEARNING ENGLISH 6 Minute English Do you think for yourself?
BBC LEARNING ENGLISH 6 Minute English Do you think for yourself? NB: This is not a word-for-word transcript Hello and welcome to 6 Minute English. I'm And I'm Here's your coffee,. remember that staff meeting
More informationA PRACTICAL GUIDE TO db CALCULATIONS
A PRACTICAL GUIDE TO db CALCULATIONS This is a practical guide to doing db (decibel) calculations, covering most common audio situations. You see db numbers all the time in audio. You may understand that
More informationConditional Probability, Independence and Bayes Theorem Class 3, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Conditional Probability, Independence and Bayes Theorem Class 3, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of conditional probability and independence
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationSimple Regression Theory II 2010 Samuel L. Baker
SIMPLE REGRESSION THEORY II 1 Simple Regression Theory II 2010 Samuel L. Baker Assessing how good the regression equation is likely to be Assignment 1A gets into drawing inferences about how close the
More informationLogic and Reasoning Practice Final Exam Spring 2015. Section Number
Logic and Reasoning Practice Final Exam Spring 2015 Name Section Number The final examination is worth 100 points. 1. (5 points) What is an argument? Explain what is meant when one says that logic is the
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
Propositional Logic: logical operators Negation ( ) Conjunction ( ) Disjunction ( ). Exclusive or ( ) Conditional statement ( ) Bi-conditional statement ( ): Let p and q be propositions. The biconditional
More informationFormalization of the CRM: Initial Thoughts
Formalization of the CRM: Initial Thoughts Carlo Meghini Istituto di Scienza e Tecnologie della Informazione Consiglio Nazionale delle Ricerche Pisa CRM SIG Meeting Iraklio, October 1st, 2014 Outline Descriptions,
More informationPolynomial Invariants
Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
More informationdef: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More informationA Short Course in Logic Example 8
A Short ourse in Logic xample 8 I) Recognizing Arguments III) valuating Arguments II) Analyzing Arguments valuating Arguments with More than one Line of Reasoning valuating If then Premises Independent
More informationNF5-12 Flexibility with Equivalent Fractions and Pages 110 112
NF5- Flexibility with Equivalent Fractions and Pages 0 Lowest Terms STANDARDS preparation for 5.NF.A., 5.NF.A. Goals Students will equivalent fractions using division and reduce fractions to lowest terms.
More informationLogic is a systematic way of thinking that allows us to deduce new information
CHAPTER 2 Logic Logic is a systematic way of thinking that allows us to deduce new information from old information and to parse the meanings of sentences. You use logic informally in everyday life and
More informationComputational Logic and Cognitive Science: An Overview
Computational Logic and Cognitive Science: An Overview Session 1: Logical Foundations Technical University of Dresden 25th of August, 2008 University of Osnabrück Who we are Helmar Gust Interests: Analogical
More informationCopyright 2012 MECS I.J.Information Technology and Computer Science, 2012, 1, 50-63
I.J. Information Technology and Computer Science, 2012, 1, 50-63 Published Online February 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijitcs.2012.01.07 Using Logic Programming to Represent
More information2. Abstract State Machines
2. Abstract State Machines The notion of Abstract State Machines (ASMs), defined in [20], captures in mathematically rigorous yet transparent form some fundamental operational intuitions of computing,
More informationPrinciples of Modeling: Real World - Model World
MODELING BASICS Principles of Modeling: Real World - Model World Tony Starfield recorded: 2005 Welcome Welcome to Principles of Modeling We all build models on a daily basis. Sometimes we build them deliberately,
More informationHow To Understand The Theory Of Computer Science
Theory of Computation Lecture Notes Abhijat Vichare August 2005 Contents 1 Introduction 2 What is Computation? 3 The λ Calculus 3.1 Conversions: 3.2 The calculus in use 3.3 Few Important Theorems 3.4 Worked
More informationOutline. Written Communication Conveying Scientific Information Effectively. Objective of (Scientific) Writing
Written Communication Conveying Scientific Information Effectively Marie Davidian davidian@stat.ncsu.edu http://www.stat.ncsu.edu/ davidian. Outline Objectives of (scientific) writing Important issues
More informationLesson 26: Reflection & Mirror Diagrams
Lesson 26: Reflection & Mirror Diagrams The Law of Reflection There is nothing really mysterious about reflection, but some people try to make it more difficult than it really is. All EMR will reflect
More informationJaakko Hintikka Boston University. and. Ilpo Halonen University of Helsinki INTERPOLATION AS EXPLANATION
Jaakko Hintikka Boston University and Ilpo Halonen University of Helsinki INTERPOLATION AS EXPLANATION INTERPOLATION AS EXPLANATION In the study of explanation, one can distinguish two main trends. On
More informationA: I thought you hated business. What changed your mind? A: MBA's are a dime a dozen these days. Are you sure that is the best route to take?
Dialog: LESSON 120 - MBA A: What are you doing tomorrow? B: I'm starting my MBA. A: I thought you hated business. What changed your mind? B: I do hate it, but I need to start making more money. A: MBA's
More informationCommon sense, and the model that we have used, suggest that an increase in p means a decrease in demand, but this is not the only possibility.
Lecture 6: Income and Substitution E ects c 2009 Je rey A. Miron Outline 1. Introduction 2. The Substitution E ect 3. The Income E ect 4. The Sign of the Substitution E ect 5. The Total Change in Demand
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationIntroduction to tuple calculus Tore Risch 2011-02-03
Introduction to tuple calculus Tore Risch 2011-02-03 The relational data model is based on considering normalized tables as mathematical relationships. Powerful query languages can be defined over such
More information