W&O: §§ 33-35 Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

1.3 Predicates and Quantifiers
UNIT 16: ABOUT DICTIONARIES A good ordinary dictionary gives three kinds of information about words: phonological, grammatical and semantic. The semanticist.
The lambda calculus David Walker CS 441. the lambda calculus Originally, the lambda calculus was developed as a logic by Alonzo Church in 1932 –Church.
Can neural realizations be neither holistic nor localized? Commentary on Anderson’s redeployment hypothesis Pete Mandik Chairman, Department of Philosophy.
W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
EPM: Ch II Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
EPM: Chs III & IV Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
EPM: Chs V & VI Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA “RED!”
Today’s Topics Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)
Knowledge Representation Methods
The Language of Theories Linking science directly to ‘meanings’
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
For Wednesday, read chapter 6, section 1. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class. In.
Presentation on Formalising Speech Acts (Course: Formal Logic)
Theories of Mind: An Introduction to Cognitive Science Jay Friedenberg Gordon Silverman.
W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Copyright © Cengage Learning. All rights reserved.
Survey of Mathematical Ideas Math 100 Chapter 3, Logic
Linguistic Theory Lecture 3 Movement. A brief history of movement Movements as ‘special rules’ proposed to capture facts that phrase structure rules cannot.
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
EPM: Chs VII & VIII Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
Introduction to Sellars and Quine Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University,
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Relational Calculus Chapter 4, Section 4.3.
EPM: Ch IX Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
Atomic Sentences Chapter 1 Language, Proof and Logic.
1st-order Predicate Logic (FOL)
W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
Theory and Applications
Database Management Systems, R. Ramakrishnan1 Relational Calculus Chapter 4.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Logic CL4 Episode 16 0 The language of CL4 The rules of CL4 CL4 as a conservative extension of classical logic The soundness and completeness of CL4 The.
Introduction to Quantification Chapter 9 Language, Proof and Logic.
EPM: Ch XII Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Copyright © 2014 Curt Hill Sets Introduction to Set Theory.
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
Theory and Applications
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
November 12, 2009Theory of Computation Lecture 17: Calculations on Strings II 1 Numerical Representation of Strings First, we define two primitive recursive.
Models of Computation: Automata and Formal Languages Sam M. Kim.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
PHILOSOPHY OF LANGUAGE Some topics and historical issues of the 20 th century.
Lecture 1-3: Quantifiers and Predicates. Variables –A variable is a symbol that stands for an individual in a collection or set. –Example, a variable.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Formal Proofs and Quantifiers
Chapter 3 The Logic of Quantified Statements
CS201: Data Structures and Discrete Mathematics I
EPM: Intro & Ch I Pete Mandik Chairman, Department of Philosophy
1st-order Predicate Logic (FOL)
EPM: Chs X & XI Pete Mandik Chairman, Department of Philosophy
Predicates and Quantifiers
Punctuating speech.
Numerical Representation of Strings
CS201: Data Structures and Discrete Mathematics I
A.C.E.: Using the A.C.E. Format to Answer Questions
1st-order Predicate Logic (FOL)
Presentation transcript:

W&O: §§ Pete Mandik Chairman, Department of Philosophy Coordinator, Cognitive Science Laboratory William Paterson University, New Jersey USA

2 Chapter V: Regimentation “(x)(Ex & Ux)” “(x)(Sx  Px)” What can be gained with translations into a canonical notation like…

3 Sec. 33. Aims and Claims of Regimentation n “Practical temporary departures from ordinary language have recommended themselves at various points….Most of these were fairly representative of the departures that one actually adopts in various pursuits short of symbolic logic…Opportunistic departure from ordinary language …is part of ordinary linguistic behavior….[C]ertain such departures have a…purpose that is decidedly worth noting: simplification of theory. Simplification of theory is a central motive…of the sweeping artificialities of notation in modern logic. …It is the part of strategy to keep theory simple where we can, and then, when we want to apply the theory to particular sentences of ordinary language, to transform those sentences into a “canonical form” adapted to the theory”. Pp

4 Sec 34.Quantifiers and Other Operators n “[W]e can dispense with almost the entire category of indefinite singular terms [by means of paraphrasing along the following lines…] n (1) Everything is an object x such that (if x is an F then…x…), n (2) Something is an object x such that (x is an F and…x…). n Thus all the indefinite singular terms are got down to ‘everything’ and ‘something’…” p. 162

5 Example of regimentation aka translation into a canonical notation n “Snakes are poisonous” becomes… n “Everything is an object x such that if x is a snake then x is poisonous” which in turn becomes… n “(x)(Sx  Px)”

6 Another example n “An elephant sat on a unicycle” becomes… n “Something is an object x such that x is an elephant and x sat on a unicycle” which in turn becomes… n “(x)(Ex & Ux)” n Note that everything is now being said in terms of quantifiers (e.g.””), variables (e.g. “x”), predicates (e.g. “P”), connectives (e.g. “&”), and parentheses (e.g. “)”).

7 Sec. 35 Variables and Referential Opacity “[T]here can be no cross-reference from inside an opaque construction to a ‘such that’ outside. Rephrased for quantification…, this says that no variable inside an opaque construction is bound by an operator outside. You cannot quantify into an opaque construction.” p. 166

8 “When ‘x’ stands inside an opaque construction and ‘(x)’ or ‘(x)’ stands outside, the attitude to take is simply that that occurrence of ‘x’ is then not bound by that occurrence of the quantifier. An example is that last occurrence of ‘x’ in: (1) (x)(x is writing ‘9 > x’). …the final ‘x’ of (1) does not refer back to ‘(x)’, is not bound by ‘(x)’, but does quite other work: it contributes to the quotational name of a three-character open sentence containing specifically the twenty-fourth letter of the alphabet.” p. 166

9 “The case of: (2) (x)(Tom believes that x denounced Catiline) Is similar in that ‘x’ is inside and ‘(x)’ outside an opaque construction …So here again we may say that the ‘(x)’ fails to bind that occurrence of ‘x’. But (2) differs from (1) in that (1) still makes sense while (2) does not. Of course these make sense: (3) (x)(Tom believes x to have denounced Catiline), (4) Tom believes that (x)(x denounced Catiline). But in each of these the ‘x’ is bound by ‘(x)’. In (3), ‘x’ and ‘(x)’ are both outside the opaque construction; in (4) they are both inside.” p

10 Study question: What would be an example of quantifying into an opaque construction and what would be an example of not quantifying into an opaque construction?

11 THE END