Predicate Calculus. There are certain arguments that seem to be perfectly logical, yet they cannot be expressed by using propositional calculus.

Save this PDF as:

Size: px
Start display at page:

Download "Predicate Calculus. There are certain arguments that seem to be perfectly logical, yet they cannot be expressed by using propositional calculus."

Transcription

1 Predicate Calculus (Alternative names: predicate logic, first order logic, elementary logic, restricted predicate calculus, restricted functional calculus, relational calculus, theory of quantification, theory of quantification with equality, etc.) In propositional logic only the logical forms of compound propositions are analyzed. A simple proposition is an unanalyzed whole which is either true or false. There are certain arguments that seem to be perfectly logical, yet they cannot be expressed by using propositional calculus. 1

2 Example 1. All cats have tails. 2. Tom is a cat. From these two sentences, one should be able to conclude that 3. Tom has a tail. To show that this argument is sound, we must be able to identify individuals, such as Tom, together with their properties and predicates. This is the objective of predicate calculus. 2

3 Generally, predicates are used to describe certain properties or relationships between individuals or objects. Example: In Mary and Jane are sisters, the phrase are sisters is a predicate. The entities connected this way, Mary and Jane, are called terms. Terms play a similar role in predicate calculus as nouns and pronouns do in the English language. In addition to terms and predicates, one uses quantifiers. Quantifiers indicate how frequently a certain statement is true. Specifically, the universal quantifier is used to indicate that a statement is always true, whereas the existential quantifier indicates that a statement is sometimes true. Example: In All cats have tails, the word all indicates that the statement cats have tails is universally true. Predicate calculus is a generalization of propositional calculus. Hence, besides terms, predicates, and quantifiers, predicate calculus contains propositional variables, constants and connectives as part of the language. An important part is played by functions which are essential when discussing equations. 3

4 Predicate calculus in Computer Science Predicate calculus gives the underpinnings to the languages of logic programming, such as Prolog. Predicate calculus is increasingly used for specifying the requirements of computer applications. In the area of proving program correctness, predicate calculus allows one to precisely state under which conditions a program gives the correct output. 4

5 Predicate Calculus: Syntax 1. The Domain (universe of discourse) Example. 1. Jane is Paul s mother. 2. Jane is Mary s mother. 3. Any two persons having the same mother are siblings. 4. Paul and Mary are siblings. The truth of the statement Jane is Paul s mother can only be assessed within a certain context. There are many people named Jane and Paul, and without further information the statement in question can refer to many different people, which makes it ambiguous. To prevent such ambiguities we introduce the concept of a domain or universe of discourse. 5

6 Definition The universe of discourse or domain is the collection of all persons, ideas, symbols, data structures, and so on, that affect the logical argument under consideration. The elements of the domain are called individuals. In the argument concerning Mary and Paul, the universe of discourse (domain) may, for instance, consist of the people living in a particular house or a particular block. Many arguments involve numbers and, in this case, one must stipulate whether the domain is the set of natural numbers, the set of integers, the set of real numbers, or the set of complex numbers. The truth of a statement may depend on the domain selected. The statement there is a smallest number is true in the domain of natural numbers, but false in the domain of integers. 6

7 The elements of the domain are called individuals. An individual can be a person, a number, a data structure, or anything else one wants to reason about. To avoid trivial cases, one stipulates that every domain must contain at least one individual. Hence, the set of all natural numbers less than 0 does not constitute a domain (universe of discourse) because there is no negative number. Instead of the word individual one sometimes uses the word object, such as in the domain must contain at least one object. To refer to a particular individual or object, identifiers must be used. These identifiers are called individual constants. If the universe of discourse consists of persons, the individual constants may be their names. In the case of natural numbers the individual constants are the digits representing these numbers. Each individual constant must uniquely identify a particular individual and no other one. 7

8 2. Predicates Generally, predicates make statements about individuals: Mary and Paul are siblings. Jane is the mother of Mary. Tom is a cat. The sum of 2 and 3 is 5. In each of these statements, there is a list of individuals, which is given by the argument list, together with phrases that describe certain relations among or properties of the individuals mentioned in the argument list. These properties or relations are referred to as predicates. 8

9 In the statement Mary and Paul are siblings, the argument list is given by Mary and Paul, in that order, whereas the predicate is described by the phrase are siblings. Similarly, the statement Tom is a cat has an argument list with the single element Tom in it, and its predicate is described by is a cat. The entries of the argument list are called arguments. The arguments can be either variables or individual constants, but since we have not discussed variables yet, we restrict our attention to the case when all arguments are individual constants. 9

10 In predicate calculus, each predicate is given a name, which is followed by the list of arguments. The list of arguments is enclosed in parantheses. To express Jane is the mother of Mary one could choose an identifier, say mother to express the predicate is the mother of, and one would write mother (Jane, Mary). Many logicians use only single letters for predicate names and constants. They would write, for instance M(j, m) instead of mother(jane, Mary); that is, they would use M as a name for the predicate is the mother of, j for Jane and m for Mary. To save space, we will often use this convention. Note that the order of arguments is important. Clearly, the statements mother(mary, Jane) and mother(jane, Mary) have a completely different meaning. 10

11 The number of elements in the argument list of a predicate is called the arity of the predicate. For instance, mother(jane, Mary) has arity 2. The arity of a predicate is fixed. For example a predicate cannot have two arguments in one case and three in another. Alternatively, one can consider two predicates different if their arity is different. The following statement illustrates this: The sum of 2 and 3 is 5. The sum of 2, 3 and 4 is 9. To express these statements in predicate calculus, one can either use two predicate names such as sum2 and sum3 and write sum2(2, 3, 5) and sum3(2, 3, 4, 9) respectively, or one can use the same symbol, say sum with the implicit understanding that the name sum in sum(2, 3, 5) refers to a different predicate than in sum(2, 3, 4, 9). 11

12 A predicate with arity n is often called an n-place predicate. A one-place predicate is called a property. Example: The predicate is a cat is a one-place predicate, or a property. The predicate is the mother of, as in Jane is the mother of Mary is a two-place predicate; that is, its arity is 2. The predicate in the statement The sum of 2 and 3 is 6 (which is false) contains the three-place predicate is the sum of. A predicate name, followed by an argument list in parantheses is called an atomic formula. The atomic formulas can be combined by logical connectives like propositions. For instance, if cat(tom) and hastail(tom) are two atomic formulas, expressing that Tom is a cat and that Tom has a tail respectively, one can form cat(tom) hastail(tom). 12

13 If all arguments of a predicate are individual constants, then the resulting atomic formula must be either true or false. This is part of the definition of the predicate. For instance, if the domain consists of Jane, Doug, Mary and Paul, we have to know for each ordered pair of individuals whether or not the predicate is the mother of is true. This can be done in the form of a table. The method that assigns truth values to all possible combinations of individuals of a predicate is called an assignment. For instance, the following table is an assignment of the predicate mother. 13

14 Example Assignment for the Predicate mother : Doug Jane Mary Paul Doug Jane Mary Paul Another example of an assignment is as follows. The domain consists of the four numbers 1, 2, 3, 4. The predicate greater is true if the first argument is greater than the second argument. Hence, greater(4, 3) is true and greater(3, 4) is false. Assignment for the Predicate greater :

15 In a finite domain (universe of discourse), one can represent the assignments of predicates with arity n by n-dimensional arrays. Note that the mathematical symbols >, < are predicates. However, these predicates are normally used in infix notation. By this, we mean that they are placed between the arguments. For instance, to express that 2 is greater than 1, we write 2 > 1 rather than > (2, 1). 15

16 3. Variables and instantiation Often one does not want to associate the arguments of an atomic formula with a particular individual. To avoid this, variables are used. Variables are frequently chosen from the end of the alphabet; that is x, y and z, with or without subscripts, suggest variable names. Examples: cat(x) hastail(x) dog(y) brown(y) grade(x) (x 0) (x 100) Clearly, the first and third formulas contain the variable x, and the second the variable y. 16

17 As in propositional calculus, formulas can be given names. For instance, one can define A as follows: A = cat(x) hastail(x). which means that when we write A we really mean cat(x) hastail(x). Syntactically, one can use variables in any place where one is allowed to use constants. The word term is therefore used to refer to either a constant or a variable. More generally, a term is anything that can be used in place of an individual (formal definition later). 17

18 Instantiation If A is a formula, one often has to replace all occurrences of a particular variable by a term. For example, in the expression cat(x) hastail(x), one may want to replace all instances of x by the term Tom which yields cat(tom) hastail(tom). Generally, if A is a formula, the formula obtained by replacing all variables x in A by the term t is denoted by S x t A. Specifically, if A is defined as previously, then S x T oma stands for cat(tom) hastail(tom). 18

19 Definition Let A represent a formula, x represent a variable, and t represent a term. Then S x t A represents the formula obtained by replacing all occurrences of x in A by t. S x t A is called an instantiation of A, and t is said to be an instance of x. Example: Let a, b, c be individual constants, P, Q, be predicate symbols, and x and y be variables. Find S x a(p (a) Q(x)) S y b (P (y) Q(y)) S y aq(a). S y a(p (x) Q(x)). St x is an operation that can be performed on predicates; therefore it is not a predicate itself, and this makes St x a meta-formula. 19

20 4. Quantifiers Consider the following three statements: 1. All cats have tails. 2. Some people like their meat raw. 3. Everyone gets a break once in a while. All these statements indicate how frequently certain things are true. In predicate calculus one uses quantifiers in this context. Definition. Let A represent a formula, and let x represent a variable. If we want to indicate that A is true for all possible values of x, we write xa. Here, x is called universal quantifier, and A is called the scope of the quantifier. The variable x is said to be bound by the quantifier. The symbol is pronounced for all. 20

21 Universal quantifiers contd. The quantifier and the bounded variable that follows have to be treated as a unit, and this unit acts somewhat like a unary connective. Statements containing words like every, each, and everyone usually indicate universal quantification. Such statements must typically be reworded such that they start with for every x, which is then translated into x. Example: Express Everyone gets a break once in a while in predicate calculus. Solution: We define B to mean gets a break once in a while. Hence, B(x) means that x gets a break once in a while. The word everyone indicates that this is true for all x. This leads to the following translation: xb(x) Example: Express All cats have tails in predicate calculus. 21

22 Existential quantifier Definition Let A represent a formula, and let x represent a variable. If we want to indicate that A is true for at least one value x, we write xa. This statement is pronounced There exists an x such that A. Here, x is called the existential quantifier, and A is called the scope of the quantifier. The variable x is said to be bound by the quantifier. Statements containing such phrases as some, and at least one suggest existential quantifiers. They should be rephrased as there is an x such that which is translated by x. Example: Let P be the predicate like their meat raw. Then xp (x) can be translated as There exist people who like their meat raw or Some people like their meat raw. Example: If the universe of discourse (domain) is a collection of things, x blue(x) should be understood as There exists objects that are blue or Some objects are blue. 22

23 Comments 1 x and x have to be treated like unary connectives. The quantifiers are given a higher precedence than all binary connectives. For instance, if P (x) and Q(x) means that x is living and that x is dead, respectively, then one has to write x(p (x) Q(x)) to indicate that everything is either living or dead. xp (x) Q(x) means that either everything is living, or x is dead. The variable x in a quantifier is just a placeholder, and it can be replaced by any other variable name not appearing elsewhere in the formula. For instance xp (x) and yp (y) mean the same thing: they are logically equivalent. The expression yp (y) is a variant of xp (x). Definition A formula is called a variant of xa if it is of the form ys x y A where y is any variable name and S x y A is the formula obtained from A by replacing all instances of x by y. Similarly, xa and ys x y A are variants of one another. 23

24 Comments 2 Quantifiers may be nested, as demonstrated by the following example. Example: Translate the sentence There is somebody who knows everyone into the language of predicate calculus. To do this, use K(x, y) to express the fact that x knows y. Solution. The best way to solve this problem is to go in steps. We write informally x(x knows everybody) Here, x knows everybody is still in English and means that for all y is it true that x knows y. Hence x knows everybody = yk(x, y) We now add the existential quantifier and obtain x yk(x, y). Example: Translate Everybody has somebody who is his or her mother. 24

25 Comments 3 The English statement Nobody is perfect also includes a quantifier, nobody which is the absence of an individual with a certain property. In predicate calculus, the fact that nobody has property P cannot be expressed directly. To express the fact that there is no x for which an expression A is true one can either use xa or x A. If P represents the property of perfection, both xp (x) and x P (x) indicate that nobody is perfect. They correspond to It is not the case that there is somebody who is perfect, respectively for everyone, it is not the case that he or she is perfect The two methods to express that nobody is A must of course be logically equivalent, xa = x A. There are many quantifiers in English, such as a few, most, and about a third, that are useful in daily language, but are not precise and cannot be used in logic. We do not consider them further. 25

26 Bound and free variables The variable appearing in the quantifier is said to be bound. For instance, in the expression x(p (x) Q(x)), the variable x appears three times and each time x is a bound variable. Any variable that is not bound is said to be free. Later we will see that the same variable can occur both bound and free in a formula. For this reason it is also important to indicate the position of the variable in question. Example: Find the free variables in z(p (z) Q(x)) yq(y). Solution: Only one variable x is free. All occurrences of z are bound, and so are all occurrences of the variable y. Note that the status of a variable changes as formulas are divided into subformulas. For instance, in xp (x), x occurs twice and it is bound both times. This formula contains P (x) as subformula. Nevertheless, in P (x) the variable x is free. 26

27 Instantiation only affects free variables. Specifically, if A is a formula, S x t A only affects the free occurrences of the variable x in A. For instance, S x y xp (x) is still xp (x); that is, the variable x is not instantiated. However, S x y (Q(x) xp (x)) yields Q(y) xp (x). Hence, instantiation treats the variable x differently, depending on whether it is free or bound, even if this variable appears twice in the same expression. Obviously, two things are only identical if they are treated identically. This implies that, if a variable appears both free and bound within the same formula, we have in fact two different variables that happen to have the same name. 27

28 Comments We can consider the bound variables to be local to the scope of the quantifier just as parameters and locally declared variables in PASCAL procedures are local to the procedure in which they are declared. The analogy to PASCAL can be extended further if we consider the variable name in the quantifier as a declaration. This analogy also suggests that, if several quantifiers use the same bound variable for quantification, then all these variables are local to their scope and they are therefore distinct. When forming variants, one must be careful not to interfere with local definitions. To illustrate this, consider the statement y has a mother. If M is a predicate name for is mother of then this statement translates into xm(x, y). One obviously must not form the statement ym(y, y), which means that y is her own mother. 28

29 For similar reasons there are restrictions to instantiation. For example, the instantiation S y x( xm(x, y)) is illegal because it results in xm(x, x). In such cases, one tampers with the way in which a variable is defined, and this has undesired side effects. We will refer to instances in which a variable becomes bound, or otherwise changes scope, as variable clashes. All variable chashes must be avoided. 29

30 Restrictions of quantifiers Sometimes, quantification is over a subset of the universe of discourse. Suppose, for instance, that animals form the universe of discourse. How can one express sentences such as All dogs are mammals and Some dogs are brown? Consider the first statement All dogs are mammals. Since the quantifier should be restricted to dogs, one rephrases the statement as If x is a dog, then x is a mammal which immediately leads to Generally, the sentence x(dog(x) mammal(x)). x(p (x) Q(x)) can be translated as All individuals with property P also have property Q.. 30

31 Consider now the statement Some dogs are brown. This means that there are some animals that are dogs and that are brown. Of course, the statement x is a dog and x is brown can be translated as dog(x) brown(x). There are some brown dogs can be now translated as The statement x(dog(x) brown(x)). x(p (x) Q(x)) can in general be interpreted as Some individuals with property P have also property Q. 31

32 Note that if the universal quantifier is to apply only to individuals with a given property, we use the conditional to restrict the domain. If we similarly want to restrict application of the existential quantifier, we use the conjunction. Consider statements containing the word only such as only dogs bark. To convert this into predicate calculus, this must be reworded as It barks only if it is a dog or, equivalently If it barks, then is is a dog. One has therefore x( barks(x) dog(x)). 32

Predicate Logic. M.A.Galán, TDBA64, VT-03

Predicate Logic 1 Introduction There are certain arguments that seem to be perfectly logical, yet they cannot be specified by using propositional logic. All cats have tails. Tom is a cat. From these two

PREDICATE LOGIC. 1 Basic Concepts. Jorma K. Mattila LUT, Department of Mathematics and Physics

PREDICATE LOGIC Jorma K. Mattila LUT, Department of Mathematics and Physics 1 Basic Concepts In predicate logic the formalism of propositional logic is extended and is made it more finely build than propositional

Predicate 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,

3. Predicates and Quantifiers

3. PREDICATES AND QUANTIFIERS 45 3. Predicates and Quantifiers 3.1. Predicates and Quantifiers. Definition 3.1.1. A predicate or propositional function is a description of the property (or properties)

CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 2 Logic: Predicate Calculus 1 Outline Predicates Quantifiers Binding Applications Logical Equivalences 2 Predicates In mathematics arguments, we will often see sentences

Predicate Logic. Lucia Moura. Winter Predicates and Quantifiers Nested Quantifiers Using Predicate Calculus

Predicate Logic Winter 2010 Predicates A Predicate is a declarative sentence whose true/false value depends on one or more variables. The statement x is greater than 3 has two parts: the subject: x is

Predicate 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

Introduction to Predicate Calculus

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.

Predicate in English. Predicates and Quantifiers. Propositional Functions: Prelude. Predicate in Logic. Propositional Function

Predicates and Quantifiers By Chuck Cusack Predicate in English In English, a sentence has 2 parts: the subject and the predicate. The predicate is the part of the sentence that states something about

4. FIRST-ORDER LOGIC

4. FIRST-ORDER LOGIC Contents 4.1: Splitting the atom: names, predicates and relations 4.2: Structures 4.3: Quantification:, 4.4: Syntax 4.5: Semantics 4.6: De Morgan s laws for and 4.7: Truth trees for

1.4 Predicates and Quantifiers

Can we express the following statement in propositional logic? Every computer has a CPU No 1 Can we express the following statement in propositional logic? No Every computer has a CPU Let's see the new

Predicate 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

Discrete Mathematics, Chapter : Predicate Logic

Discrete Mathematics, Chapter 1.4-1.5: Predicate Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.4-1.5 1 / 23 Outline 1 Predicates

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.

1.2 The predicate Calculus

1.2 The predicate Calculus In propositional calculus, each atomic symbol (P, 0, etc.) denotes a proposition of some complexity. There is no way to access the components of an individual assertion. Predicate

CHAPTER 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

INTRODUCTION TO LOGIC Lecture 4 The Syntax of Predicate Logic Dr. James Studd. Subject-Predicate form. Designators/Constants. is a tortoise Predicate

Introduction INTRODUCTION TO LOGIC Lecture 4 The Syntax of Predicate Logic Dr. James Studd I counsel you, dear friend, in sum, That first you take collegium logicum. Your spirit s then well broken in for

1 Proposition, Logical connectives and compound statements

Discrete Mathematics: Lecture 4 Introduction to Logic Instructor: Arijit Bishnu Date: July 27, 2009 1 Proposition, Logical connectives and compound statements Logic is the discipline that deals with the

Chapter 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

Logic will get you from A to B. Imagination will take you everywhere.

Chapter 3 Predicate Logic Logic will get you from A to B. Imagination will take you everywhere. A. Einstein In the previous chapter, we studied propositional logic. This chapter is dedicated to another

DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

Predicate Logic. PHI 201 Introductory Logic Spring 2011

Predicate Logic PHI 201 Introductory Logic Spring 2011 This is a summary of definitions in Predicate Logic from the text The Logic Book by Bergmann et al. 1 The Language PLE Vocabulary The vocabulary of

9.1: Predicates and Quantifiers

9.1: Predicates and Quantifiers Expressive Limitations of Statement Logic Many intuitively valid arguments in ordinary language cannot be represented as valid in statement logic. For example: This house

Introduction to Predicate Logic. Torben Braüner Roskilde University

Introduction to Predicate Logic Torben Braüner Roskilde University 1 Plan Symbolization of sentences Syntax Semantics 2 Propositional logic The sentence is the smallest syntactic unit Predicate logic Sentences

Chapter 1, Part II: Predicate Logic. With Question/Answer Animations

Chapter 1, Part II: Predicate Logic With Question/Answer Animations Summary Predicate Logic (First Order Logic (FOL), Predicate Calculus (not covered)) The Language of Quantifiers Logical Equivalences

CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo

Propositional Logic CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 37 Discrete Mathematics What is Discrete

MATH 55: HOMEWORK #2 SOLUTIONS

MATH 55: HOMEWORK # SOLUTIONS ERIC PETERSON * 1. SECTION 1.5: NESTED QUANTIFIERS 1.1. Problem 1.5.8. Determine the truth value of each of these statements if the domain of each variable consists of all

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

Valid formulas, games and network protocols

Valid formulas, games and network protocols Jean-Louis Krivine & Yves Legrandgérard Paris VII University, CNRS November 14, 2007 Introduction We describe a remarkable relation between a fundamental notion

Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

Chapter I Logic and Proofs

MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than

Introduction to Predicate Logic. Ling324 Reading: Meaning and Grammar, pg

Introduction to Predicate Logic Ling324 Reading: Meaning and Grammar, pg. 113-141 Usefulness of Predicate Logic for Natural Language Semantics While in propositional logic, we can only talk about sentences

Section 7.1 First-Order Predicate Calculus predicate Existential Quantifier Universal Quantifier.

Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially or universally. A predicate describes a

1.4/1.5 Predicates and Quantifiers

1.4/1.5 Predicates and Quantifiers Can we express the following statement in propositional logic? Every computer has a CPU No Outline: Predicates Quantifiers Domain of Predicate Translation: Natural Languauge

Inference Rules and Proof Methods

Inference Rules and Proof Methods Winter 2010 Introduction Rules of Inference and Formal Proofs Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument

The 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

Mathematics 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

CSI 2101 Discrete Structures Winter 2012

CSI 2101 Discrete Structures Winter 2012 Prof. Lucia Moura University of Ottawa Homework Assignment #1 (100 points, weight 5%) Due: Thursday Feb 9, at 1:00 p.m. (in lecture); assignments with lateness

Invalidity 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

Mathematics 0N1 Solutions 1 1. Write the following sets in list form. 1(i) The set of letters in the word banana. {a, b, n}. 1(ii) {x : x 2 + 3x 10 = 0}. 3(iv) C A. True 3(v) B = {e, e, f, c}. True 3(vi)

DISCRETE MATH: LECTURE 4

DISCRETE MATH: LECTURE 4 DR. DANIEL FREEMAN 1. Chapter 3.1 Predicates and Quantified Statements I A predicate is a sentence that contains a finite number of variables and becomes a statement when specific

Predicates and Quantifiers. Niloufar Shafiei

Predicates and Quantifiers Niloufar Shafiei Review Proposition: 1. It is a sentence that declares a fact. 2. It is either true or false, but not both. Examples: 2 + 1 = 3. True Proposition Toronto is the

Subjects, Predicates and The Universal Quantifier

Introduction to Logic Week Sixteen: 14 Jan., 2008 Subjects, Predicates and The Universal Quantifier 000. Office Hours this term: Tuesdays and Wednesdays 1-2, or by appointment; 5B-120. 00. Results from

The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

Mathematical 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

Handout #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

3. 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)

First Order Predicate Logic. Lecture 4

First Order Predicate Logic Lecture 4 First Order Predicate Logic Limitation of Propositional Logic The facts: peter is a man, paul is a man, john is a man can be symbolized by P, Q and R respectively

What is logic? Propositional Logic. Negation. Propositions. This is a contentious question! We will play it safe, and stick to:

Propositional Logic This lecture marks the start of a new section of the course. In the last few lectures, we have had to reason formally about concepts. This lecture introduces the mathematical language

Introduction to Proofs

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

Predicate logic is an Extension of sentence logic. Several new vocabulary items are found in predicate logic.

Atomic Sentences of Predicate Logic Predicate Logic and Sentence Logic Predicate logic is an Extension of sentence logic. All items of the vocabulary of sentence logic are items of the vocabulary of predicate

First-Order Predicate Logic (2)

First-Order Predicate Logic (2) Predicate Logic (2) Understanding first-order predicate logic formulas. Satisfiability and undecidability of satisfiability. Tautology, logical consequence, and logical

Logic, Sets, and Proofs

Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical

Chapter 1. Logic and Proof

Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known

4 Domain Relational Calculus

4 Domain Relational Calculus We now present two relational calculi that we will compare to RA. First, what is the difference between an algebra and a calculus? The usual story is that the algebra RA is

6.825 Techniques in Artificial Intelligence. First-Order Logic

6.825 Techniques in Artificial Intelligence First-Order Logic Lecture 5 1 At the end of the last lecture, I talked about doing deduction and propositional logic in the natural deduction, high-school geometry

CS 441 Discrete Mathematics for CS Lecture 4. Predicate logic. CS 441 Discrete mathematics for CS. Announcements

CS 441 Discrete Mathematics for CS Lecture 4 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 due today Homework assignment 2: posted on the course

The Predicate Calculus in AI

Last time, we: The Predicate Calculus in AI Motivated the use of Logic as a representational language for AI (Can derive new facts syntactically - simply by pushing symbols around) Described propositional

Relational Query Languages

Relational Query Languages Universidad de Concepción, 2014 (Slides adapted from Loreto Bravo, who adapted from Werner Nutt who adapted them from Thomas Eiter and Leonid Libkin) Bases de Datos II 1 Queries

Introduction 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

MATH 214 Mathematical Problem Solving for MCED Spring 2011

MATH 214 Mathematical Problem Solving for MCED Spring 2011 Venn Diagrams 1 The English logician John Venn (1834-1923) 2 invented a simple visual way of describing relationships between sets. His diagrams,

MAT Discrete Mathematics

RHODES UNIVERSITY Grahamstown 6140, South Africa Lecture Notes CCR MAT 102 - Discrete Mathematics Claudiu C. Remsing DEPT. of MATHEMATICS (Pure and Applied) 2005 Mathematics is not about calculations but

Satisfiability Checking

Satisfiability Checking First-Order Logic Prof. Dr. Erika Ábrahám RWTH Aachen University Informatik 2 LuFG Theory of Hybrid Systems WS 14/15 Satisfiability Checking Prof. Dr. Erika Ábrahám (RWTH Aachen

1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

Deduction by Daniel Bonevac. Chapter 5 Quantifiers

Deduction by Daniel Bonevac Chapter 5 Quantifiers Limitations of sentential logic Sentential logic is useful, but there are many logical relationships that it simply can not represent. For example, sentential

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

Propositional 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

Predicate Logic. A Modem Formal Logic Primer. Syntax. Volume II

A Modem Formal Logic Primer Volume II Predicate Logic Syntax 1-1. WE NEED MORE LOGICAL FORM In Volume I you gained a firm foundation in sentence logic. But there must be more to logic, as you can see from

Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS

1 CHAPTER 6. MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATHEMATICAL INDUCTION AND DIFFERENCE EQUATIONS 1 Introduction Recurrence

Artificial Intelligence. 5. First-Order Logic

Artificial Intelligence Artificial Intelligence 5. First-Order Logic Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL) Institute of Economics and Information Systems & Institute

Section 1.3: Predicate Logic

1 Section 1.3: Purpose of Section: To introduce predicate logic (or first-order logic) which the language of mathematics. We see how predicate logic extends the language of sentential calculus studied

Discrete Mathematics (2009 Spring) Foundations of Logic ( , 4 hours)

Discrete Mathematics (2009 Spring) ( 1.1-1.4, 4 hours) Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 1, 2010 Mathematical Logic is a tool for working with complicated compound

Fundamentals of Mathematics Lecture 6: Propositional Logic

Fundamentals of Mathematics Lecture 6: Propositional Logic Guan-Shieng Huang National Chi Nan University, Taiwan Spring, 2008 1 / 39 Connectives Propositional Connectives I 1 Negation: (not A) A A T F

6 TRANSLATIONS IN MONADIC PREDICATE LOGIC 1. Introduction... 256 2. The Subject-Predicate Form Of Atomic Statements... 257 3. Predicates... 258 4. Singular Terms... 260 5. Atomic Formulas... 262 6. Variables

Semantics for the Predicate Calculus: Part I

Semantics for the Predicate Calculus: Part I (Version 0.3, revised 6:15pm, April 14, 2005. Please report typos to hhalvors@princeton.edu.) The study of formal logic is based on the fact that the validity

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

SJÄLVSTÄNDIGA ARBETEN I MATEMATIK

SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Automated Theorem Proving av Tom Everitt 2010 - No 8 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET, 106 91 STOCKHOLM

Discrete 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

CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

Math 3000 Running Glossary

Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (

Chapter 1 LOGIC AND PROOF

Chapter 1 LOGIC AND PROOF To be able to understand mathematics and mathematical arguments, it is necessary to have a solid understanding of logic and the way in which known facts can be combined to prove

CS540 Introduction to Artificial Intelligence: First-Order Logic. Prof. Michael Coen Week of Monday, October 26, 2015 (Week #8)

CS540 Introduction to Artificial Intelligence: First-Order Logic Prof. Michael Coen Week of Monday, October 26, 2015 (Week #8) Midterm Notes Midterm: 7:15PM 9:15PM, Thursday, March 26. Room 113 in the

Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

31 is a prime number is a mathematical statement (which happens to be true).

Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to

Encoding Mathematics in First-Order Logic

Applied Logic Lecture 19 CS 486 Spring 2005 Thursday, April 14, 2005 Encoding Mathematics in First-Order Logic Over the past few lectures, we have seen the syntax and the semantics of first-order logic,

CHAPTER 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:

So 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

The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

A Little Set Theory (Never Hurt Anybody)

A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra

LECTURE 10: FIRST-ORDER LOGIC. Software Engineering Mike Wooldridge

LECTURE 10: FIRST-ORDER LOGIC Mike Wooldridge 1 Why not Propositional Logic? Consider the following statements: all monitors are ready; X12 is a monitor. We saw in an earlier lecture that these statements

(Refer Slide Time: 1:41)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 10 Sets Today we shall learn about sets. You must

Sounds Like Like. Peter Lasersohn. University of Rochester. Abstract: It is argued that the verb sound is ambiguous between

Sounds Like Like Peter Lasersohn University of Rochester Abstract: It is argued that the verb sound is ambiguous between one reading where it denotes a two-place relation between individuals and properties,

Chapter 31 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M.

31 Geometric Series Motivation (I hope) Geometric series are a basic artifact of algebra that everyone should know. 1 I am teaching them here because they come up remarkably often with Markov chains. The

4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

Type Theory & Functional Programming

Type Theory & Functional Programming Simon Thompson Computing Laboratory, University of Kent March 1999 c Simon Thompson, 1999 Not to be reproduced i ii To my parents Preface Constructive Type theory has

Induction and Recursion

Induction and Recursion Jan van Eijck June 3, 2003 Abstract A very important proof method that is not covered by the recipes from Chapter 3 is the method of proof by Mathematical Induction. Roughly speaking,