THE RIGHT SQUARE Hartley Slater University of Western Australia.

Slides:



Advertisements
Similar presentations
1.3 Predicates and Quantifiers
Advertisements

Introduction to Proofs
Propositional Predicate
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman.
Leibniz Part 1. Short Biography Leibniz ( ) was the son of a professor of philosophy who had earned his doctorate in law by 21. He invented.
Copyright © Cengage Learning. All rights reserved.
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.
RMIT University; Taylor's College This is a story about four people named Everybody, Somebody, Anybody and Nobody. There was an important job to be done.
Proof Points Key ideas when proving mathematical ideas.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
9/28/98 Prof. Richard Fikes First-Order Logic Knowledge Interchange Format (KIF) Computer Science Department Stanford University CS222 Fall 1998.
The Square Root of 2, p, and the King of France: Ontological and Epistemological Issues Encountered (and Ignored) in Introductory Mathematics Courses Martin.
Discrete Mathematics Math 6A Instructor: M. Welling.
Copyright © Cengage Learning. All rights reserved.
Intro to Set Theory. Sets and Their Elements A set A is a collection of elements. If x is an element of A, we write x  A; if not: x  A. Say: “x is a.
Predicates and Quantifiers
LIN1180/LIN5082 Semantics Lecture 3
Discrete Mathematics and Its Applications
KNOWLEDGE What is it? How does it differ from belief? What is the relationship between knowledge and truth? These are the concerns of epistemology How.
Logic Specification and Z Schema 3K04 McMaster. Basic Logic Operators Logical negation ( ¬ ) Logical conjunction ( Λ or & ) Logical disjunction ( V or.
1 Section 1.1 A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Thinking Mathematically Logic 3.6 Negations of Conditional Statements and De Morgan’s Laws.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
Chapter 18: Conversion, Obversion, and Squares of Opposition
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
Lecture 4: Predicates and Quantifiers; Sets.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Automated Reasoning Early AI explored how to automate several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Thinking Mathematically
Presentation about pragmatic concepts Implicatures Presuppositions
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Copyright © Cengage Learning. All rights reserved. Line and Angle Relationships 1 1 Chapter.
CS104:Discrete Structures Chapter 2: Proof Techniques.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
UNIT6: PHILOSOPHY: PERSONAL IDENTITY
PHILOSOPHY OF LANGUAGE Some topics and historical issues of the 20 th century.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
Chapter 1 Logic and Proof.
Advanced Algorithms Analysis and Design
Thinking Mathematically
Negations of Quantified Statements
Philosophy of Language Seminar 2: Definite Descriptions (1)
Copyright © Cengage Learning. All rights reserved.
Ethics: Theory and Practice
4.1 The Components of Categorical Propositions
Introduction to Predicates and Quantified Statements II
Introduction to Predicates and Quantified Statements II
(1.4) An Introduction to Logic
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Symbolic Logic 2/25/2019 rd.
Predicates and Quantifiers
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
1.3 Propositional Equivalences
Presentation transcript:

THE RIGHT SQUARE Hartley Slater University of Western Australia

Strawson 1

Strawson 2

Strawson 3

Strawson 4

Carroll

Carroll’s Reading On Carroll’s analysis the positive forms A and I carry existential import but the negative forms E and O do not. So the law of Obversion does not hold (also Contraposition). Thus XEY does not imply XA~Y, and XOY does not imply XI~Y. The lack of implication in the latter case, for instance, is because the O form is now read with an external negation: ‘Not all Xs are Ys’, in place of ‘Some Xs are not Ys’, which has an internal or predicate negation. ‘Not all Xs are Ys’ is then the disjunction of ‘Some Xs are not Ys’ and ‘No Xs are Ys’ (or ‘There are no Xs’). In fact this was Aristotle’s view of the situation (see Manley Thompson’s ‘On Aristotle’s Square of Opposition’ Philosophical Review 62 (1953), ; also A.N.Prior’s Formal Logic (O.U.P., Oxford, 1962), p126.

Other Cases Aristotle even applied the distinction between external and internal negations to singular statements, saying both ‘Socrates is well’ and ‘Socrates is ill’ would be false if ‘Socrates does not exist’ was true. Taking ‘Socrates’ to be a description, in the manner of Quine, this shows that Russell’s analysis of definite desriptions followed both Aristotle’s and Carroll’s line of analysis. In fact it is well known that Russell thought highly of Carroll’s work, so it could well have been one inspiration for his Theory of Descriptions. Thus, for Russell, ‘The king of France is bald’ entails ‘Some king of France is bald’. But ‘It is not the case that the king of France is bald’ does not entail ‘The king of France is not bald’. The former contains an external negation, and in it ‘the king of France’ has a ‘secondary occurrence’ as a result. The latter contains an internal, or predicate negation, and in it ‘the king of France’ has a ‘primary occurrence’ as a result.

Parallel Analyses There is supporting evidence for the original Aristotelian interpretation of universal statements when one considers other quantifiers. Thus ‘Almost all Xs are Ys’, ‘Most Xs are Ys’, and ‘A lot of Xs are Ys’ surely all entail ‘Some Xs are Ys’. Also ‘Not a lot of Xs are Ys’, for instance, unlike ‘A few Xs are not Ys’, allows it to be possible that no Xs are Ys (or that there are no Xs at all). So, unlike when there is an internal negation, there is no entailment from the form with the external negation to ‘Some Xs are not Ys’. Clearly, also, a probabilistic analysis of the Aristotelian forms also supports the original reading. For pr(Yx/Xx) = 1 entails Pr(Yx/Xx) > 0. But pr(Yx/Xx) ≠ 1 does not entail Pr(~Yx/Xx) > 0, since it is possible that pr(Xx) = 0. The probabilistic analysis is applicable also, of course, to many other quantifiers. Thus ‘Most Xs are Ys’ can be represented as ‘pr(Yx/Xx) >> 1/2’, and ‘Few Xs are not Ys’ can be represented as ‘pr(~Yx/Xx) << 1/2’.

A Historical Puzzle Given the above, it is surprising in many ways that the Aristotelian analysis was lost sight of, and concentration on merely universal quantifiers and their negations took over public attention. One supposed difficulty with Aristotelian Syllogistic, for instance, was its seeming restriction to monadic predicate logic. In this respect the polyadic logics developed by Peirce and Frege were taken to win out. How can Aristotelian Syllogistic handle relational expressions like ‘All boys love some girls’, for example? That has been taken to be a great stumbling block. But not only can probabilistic analyses handle such cases; they also can be easily generalised to many other quantifiers. Thus not only is ‘All boys love some girls’ ‘pr([pr(Lxy/Gy) > 0]/Bx) = 1’, but ‘Most boys love few girls’ is ‘pr([pr(Lxy/Gy) > 1/2’.