Relations are Not Sets of Ordered Pairs Ingvar Johansson, Institute for Formal Ontology and Medical Information Science, Saarbrücken 2004-10-09.

Slides:



Advertisements
Similar presentations
First-Order Logic Chapter 8.
Advertisements

Combinational Circuits
Copyright © Cengage Learning. All rights reserved.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
Against Determinable Universals University of Durham, November 24, 2009 Dr Markku Keinänen University of Turku
Realism with respect to Universals Ingvar Johansson, Institute for Formal Ontology and Medical Information Science, Saarbrücken
Universals, Properties, Kinds
Direct realism Michael Lacewing
Vocabulary and Properties. Determine the word or phrase described in each slide.
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 52 Database Systems I Relational Algebra.
Copyright © Zeph Grunschlag, Set Operations Zeph Grunschlag.
Review Test 5 You need to know: How to symbolize sentences that include quantifiers of overlapping scope Definitions: Quantificational truth, falsity and.
Tropes and Ontic Predication Markku Keinänen Postdoctoral researcher Department of Philosophy University of Turku "Substance & Attribute" conference in.
Functions as Physical Dimensions Ingvar Johansson Informal symposium on philosophy of biology Buffalo, NY, October 15, 2006.
Immanent Realism, Orderings and Quantities Ingvar Johansson, Institute for Formal Ontology and Medical Information Science, Saarbrücken
Intentionality and Biological Functions Ingvar Johansson, Institute for Formal Ontology and Medical Information Science, Saarbrücken
FIRST ORDER LOGIC Levent Tolga EREN.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Epistemology Revision
Section 1.1 Numbers and Their Properties.
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
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.
The physical reductive explainability of phenomenal consciousness and the logical impossibility of zombies Marco Giunti University of Cagliari (Italy)
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
Atomic Sentences Chapter 1 Language, Proof and Logic.
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.
Algebra Form and Function by McCallum Connally Hughes-Hallett et al. Copyright 2010 by John Wiley & Sons. All rights reserved. 3.1 Solving Equations Section.
Sets Defined A set is an object defined as a collection of other distinct objects, known as elements of the set The elements of a set can be anything:
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Discrete Structure Sets. 2 Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element.
LDK R Logics for Data and Knowledge Representation PL of Classes.
PHIL012 Class Notes 1/15/2001. Outline Announcements, web page Review Homework Problems (1-7) Set Theory Review & Problem 8 (if time) Assignment for Wednesday.
CompSci 102 Discrete Math for Computer Science
Copyright © Cengage Learning. All rights reserved.
Lecture 4: Predicates and Quantifiers; Sets.
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Ontology Engineering Lab #5 – September 30, 2013.
Chapter 2 With Question/Answer Animations. Section 2.1.
INM175 Topic 8 1 Module INM175 Discrete Mathematics Topic 8 Algebraic Theories.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
General Ontology with 3 Categories entitiesthings facts formsparticulars universals atomic facts molecular facts.
Based on slides by Patrice Belleville and Steve Wolfman CPSC 121: Models of Computation Unit 11: Sets.
Copyright © Cengage Learning. All rights reserved Inequalities 2. Equations and Inequalities.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Of 29 lecture 15: description logic - introduction.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Precalculus Fifth Edition Mathematics for Calculus James Stewart Lothar Redlin Saleem Watson.
English for Economic Informatics I Tomáš Foltýnek Theoretical Foundations of Informatics.
David Lewis, “New Work for a Theory of Universals” The Problem of the One over the Many: Many different particulars can all have what appears to be the.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
Universals Particulars share general features or attributes, e.g., redness, heaviness, doghood, These “things” are known as universals. But are these really.
ALGEBRAIC EXPRESSION A mathematical phrase that can contain ordinary numbers, variables (x,n,y) and operators (+,-, ●,÷). ex: 3x–5+m-8.
Trigonometric Identities
Lecture 7 Modality: Metaphysics of possible worlds
Chapter 2 Sets and Functions.
Lecture 2 Universals: realism
ece 720 intelligent web: ontology and beyond
Lecture 1 – Formal Logic.
A new perspective on philosophical debates
Trigonometric Identities
The Theory of Forms or The Theory of Ideas
Section 3.7 Switching Circuits
Lecture Sets 2.2 Set Operations.
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

Relations are Not Sets of Ordered Pairs Ingvar Johansson, Institute for Formal Ontology and Medical Information Science, Saarbrücken

The Importance of Relations The question of relations is one of the most important that arise in philosophy, as most other issues turn on it: monism and pluralism; the question whether anything is wholly true except the whole of truth, or wholly real except the whole of reality; idealism and realism, in some of their forms; perhaps the very existence of philosophy as a subject distinct from science and possessing a method of its own. (Bertrand Russell, Logical Atomism, 1924.)

General Message Features of representations must not be conflated with what is represented.

Specific Message An internal relation can be represented by, but not be identical with an ordered pair or a set of ordered pairs.

Interesting Consequence There are no anti-symmetrical internal relations in the language-independent world.

Identity and Representation Circles are not identical with an equation. Relations are not identical with sets of ordered pairs, In both cases, it is merely a matter of representation. (x - a) 2 + (y - b) 2 = r 2 y x b a

Relations in Set Theory relation, a two-or-more-place property (e.g. loves or between), or the extension of such a property. In set theory, a relation is any set of ordered pairs (or triples, etc., but these are reducible to pairs). For simplicity, the formal exposition here uses the language of set theory, although an intensional (property-theoretic) view is later assumed. (The Cambridge Dictionary of Philosophy, 1999.)

Quotation “Because relations are sets of ordered pairs, we can combine them using set of operations of union, intersection, and complement. These are called Boolean operations.”

Relation Terminology Relation – relations Relatum – relata Binary, ternary, …, n-ary Symbolism: Rab (=aRb), Rabc, Rabcd, etc. Ordered pair: Set of ordered pairs:  : such that …  or ,,... 

Kinds of Ontological Relations Relations of Existential dependence; relata are existentially dependent on each other, e.g., perceived color and perceived spatial extension. Intentional relations; can exist with only one relatum, e.g., love. External relations; independent of the qualities of the relata related, e.g. spatial distance. Internal relations (comparative, grounded); dependent on the qualities of the relata related, e.g. larger than, lighter than, rounder than.

Internal Relations Between Quality Instances are Grounded in Universals The thing T 1 is larger than the thing T 2 because T 1 has an area-instance, a, that is larger than the area-instance of T 2, b. Every area-instance that instantiates the same universal as a is larger than every area-instance that instantiates the same universal as b. T 2 : b T 1 : a

Internal Relations have Specific Features Possibly, a exists but not b, or vice versa (compare existential dependence). Necessarily: if both a and b exist, then the relation of “being larger than” is instantiated (compare external relations). b a

Internal Relations can be Perceived a is larger than b b is larger than c a is larger than c a and d are equally large a is more similar to b than to c a d b c

Internal Relations require a Determinable a is larger than b a and d are equally large a is more similar to b than to c a, b, c, and d are different determinate instances of the same determinable. a d b c

Internal Relations require a Determinable Statements describing internal relations: “a is smaller than b”, “a is heavier than b”, “a is more electrically charged than b”, “a has greater intensity than b”, etc. These internal relations have different relata of the same kind. Resemblance (both exact and non-exact) is always resemblance in a certain respect. A determinate-determinable distinction (W.E. Johnson) has to be made explicit.

Exact Resemblance When two things are equally large there is a relation of exact resemblance between the two quality instances in question. But there is only one universal. When two particulars are qualitatively identical there is necessarily a relation of exact resemblance between them.

Non-Exact Resemblance When two things have different areas there is a relation of non-exact resemblance between the two area instances in question. There are then two universals. Between these universals there is an internal relation, a determinate kind of resemblance. When the universals are instantiated there is also an internal relation between the corresponding instances.

Internal Relations can be Mind-Independent We discover that a is larger than b, that a and d are equally large, and that a is more similar to b than to c. True of both binary and ternary relations. a d b c

Internal Relations are Epiphenomena a and d are equally large. a is larger than b. There are epiphenomenal natural facts. Epiphenomena add to being. a d b c

Language Lumps Together What is true of the ordinary language terms, are true of “larger than”, too. But not of “2.13 times as large as”. blue green y red

Internal Relations in Set Theory a is larger than b = def   : such that x is larger than y  ? No, circular definition.  ,,,, …  ? No, can’t distinguish between extensionally equivalent relations. a d b c

Internal Relations in Set Theory a is larger than b = def ? No, can’t distinguish between extensionally equivalent relations. But, of course, can be used to represent the fact that a is larger than b. a d b c

Properties of Internal Relations ‘larger than’ (L) is asymmetric:  xy (Lxy  ¬Lyx) Lab & ¬Lba ‘equally large’ (E) is symmetric:  xy (Exy  Eyx) Ead & Eda a d b c

Anti-Symmetrical Relations ‘larger than or equal to’ is anti-symmetric:  xy (x ≥ y) & (y ≥ x)  x = y. (a ≥ d) & (d ≥ a) & (a = d). In the individual case there is only symmetry. (a ≥ b) & ¬(b ≥ a) In the individual case there is only asymmetry. No case is anti-symmetric. a d b c

Anti-Symmetrical Relations and their Relata Anti-symmetry: (a ≥ d & d ≥ a)  (a = d). If a and d are numbers, then ‘=’ means numerical identity. If a and d are quality instances, then ‘=’ means qualitative identity. If a and d are universals, then ‘=’ means numerical identity.

Representations and Represented: Possible Mistake There are no anti-symmetrical internal relational universals. Predicates ( ≥ ) can be anti-symmetric. Sets of ordered pairs can be anti-symmetric. Representations of internal relations can be anti-symmetric but internal relations cannot.

Representations and Represented: Logical Constants and the World The statement “The spot is red or green” contains a disjunction. The language-independent world contains no corresponding disjunctive fact. The spot is red or green

Can’t Disjunctions be Truthmakers even for Categorical Assertions? “The spot is red or green.” “The spot is red.” Isn’t in both cases a disjunction a truthmaker? v v v v v v. Answer: In the latter case, we talk as if there is in the world only one property. Language lumps together.

Representations and Represented: Scales and Quantities meter ‘1 m’ represents the standard meter. ‘7 m’ represents all things that are seven times as long as the standard meter. ‘0 m’ represents nothing at all, but it is part of the scale.

The End There are in the language-independent world no disjunctive facts. There are in the language-independent world no zero quantities. There are in the language-independent world no anti-symmetrical relations. In language, there are disjunctions, zero quantities, as well as anti-symmetrical relations.