1. 2 3 4 A Simple Partition 5 A partition can be more or less refined.

Slides:



Advertisements
Similar presentations
SCIENTIFIC CONCEPTS OF TIME AND SPACE. Time has played a central role in mathematics from its very beginnings, yet it remains one of the most mysterious.
Advertisements

Algorithms for computing Canonical labeling of Graphs and Sub-Graph Isomorphism.
Overview Functional Testing Boundary Value Testing (BVT)
1 Ontological Imperialism Barry Smith Presented at GIScience 2000: First International Conference on Geographic Information Science, Savannah, Georgia.
The Engineering Design of Systems: Models and Methods
Partitions. Theory of granular partitions There is a projective relation between cognitive subjects and reality Major assumptions: Humans ‘see’ reality.
1 Barry Smith Department of Philosophy (Buffalo) Institute for Formal Ontology and Medical Information Science (Leipzig) ontology.buffalo.edu ifomis.de.
Denoting the beginning
1 A Unified Theory of Vagueness and Granularity Barry Smith
1 Part 3 Tools of Ontology: Universals, Partitions.
1 The Ontology of Measurement Barry Smith ONTOLOGIST.cOm.
1 The Ontology of Measurement Barry Smith ONTOLOGIST.cOm.
1 A Simple Partition A partition can be more or less refined.
Constituent ontologies and granular partitions Thomas Bittner and Barry Smith IFOMIS – Leipzig and Department of Philosophy, SUNY Buffalo.
1 A Unified Theory of Vagueness and Granularity Barry Smith
1 The Theory of Granular Partitions: A New Paradigm for Ontology Barry Smith Department of Philosophy University at Buffalo
A taxonomy of granular partitions Thomas Bittner and Barry Smith Northwestern University, NCGIA and SUNY Buffalo.
A Unified Theory of Granularity, Vagueness and Approximation Thomas Bittner and Barry Smith Northwestern University NCGIA and SUNY Buffalo.
©2005 Austin Troy. All rights reserved Lecture 3: Introduction to GIS Part 1. Understanding Spatial Data Structures by Austin Troy, University of Vermont.
1 VT 2 Ontology and Ontologies Barry Smith 3 IFOMIS Strategy get real ontology right first and then investigate ways in which this real ontology can.
Theoretical Computer Science COMP 335 Fall 2004
1 SNAP and SPAN Barry Smith and Pierre Grenon University at Buffalo and Institute for Formal Ontology and Medical Information Science (ifomis.de) University.
A taxonomy of granular partitions Thomas Bittner and Barry Smith Northwestern University, NCGIA and SUNY Buffalo.
Granular Partitions and Vagueness Thomas Bittner and Barry Smith Northwestern University NCGIA and SUNY Buffalo.
The Logic of Biological Classification Barry Smith March 2004.
Constituent ontologies and granular partitions Thomas Bittner and Barry Smith IFOMIS – Leipzig and Department of Philosophy, SUNY Buffalo.
1 Truth and Categorization Barry Smith
Software Testing and QA Theory and Practice (Chapter 6: Domain Testing) © Naik & Tripathy 1 Software Testing and Quality Assurance Theory and Practice.
Software Testing Sudipto Ghosh CS 406 Fall 99 November 9, 1999.
Preview Warm Up California Standards Lesson Presentation.
9/9/2015 Math SL1 - Santowski 1 9/9/2015 Math SL1 - Santowski 1 T The Inverse Function.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
Representing Functions
Black-box Testing.
7. Parsing in functional unification grammar Han gi-deuc.
Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence Monday, January 22, 2001 William.
1 The Ontology of CLASSIFICATION Barry Smith ONTOLOGIST.cOm.
Math Chapter 6 Part II. POWER SETS In mathematics, given a set S, the power set of S, written P(S) or 2 n(S), is the set of all subsets of S. Remember.
Language: Set of Strings
Software testing techniques Spring 2009 Csci565: Theory and Practice of Software Testing1.
Properties of Matter Section 2.1.
Types of Maps.
Lecture 2 (Chapter 2) Introduction to Semantics and Pragmatics.
1 T2.1- Lesson 1 - Functions: Concepts and Notations IB Math SL1 - Santowski 2/13/2016 Math SL 1 - Santowski.
1 Software Testing and Quality Assurance Theory and Practice Chapter 6 Domain Testing.
Holt Algebra Relations and Functions 4-2 Relations and Functions Holt Algebra 1 Warm Up Warm Up Lesson Presentation Lesson Presentation Lesson Quiz.
1 VT. 2 Barry Smith Department of Philosophy (Buffalo) Institute for Formal Ontology and Medical Information Science (Leipzig) ontology.buffalo.edu ifomis.de.
Chapter 14 Semantic Modeling. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.14-2 Topics in this Chapter The Overall Approach The E/R Model.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
Lesson 8 - The Inverse Function Math 2 Honors - Santowski.
1 © 2011 Professor W. Eric Wong, The University of Texas at Dallas Requirements-based Test Generation for Functional Testing W. Eric Wong Department of.
MAT 2720 Discrete Mathematics Section 3.3 Relations
3/9/2016 Math SL1 - Santowski 1 3/9/2016 Math SL1 - Santowski 1 Lesson 14 - The Inverse Function.
Review Functions. Function A function is a special type of relation in which each element of the domain is paired with exactly one element of the range.
Structure/ Composition of materials MATTER Chapter 9.
6/12/2016HL1 Math - Santowski1 Lesson 10 – Inverses & Inverse Functions IBHL1 Math - Santowski 6/12/20161.
1 Aristotle beta version.
“It is impossible to define every concept.” For example a “set” can not be defined. But Here are a list of things we shall simply assume about sets. A.
CS223: Software Engineering
Data Mining: Concepts and Techniques
Cartesian product Given two sets A, B we define their Cartesian product is the set of all the pairs whose first element is in A and second in B. Note that.
What do you think Chemistry is?
Handouts Software Testing and Quality Assurance Theory and Practice Chapter 6 Domain Testing
PC trees and Circular One Arrangements
Overview Functional Testing Boundary Value Testing (BVT)
Objectives: Identify functions. Find the domain and range.
Lecture Sets 2.2 Set Operations.
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Lesson 6a – Introduction to Functions: Concepts and Notations
Presentation transcript:

1

2

3

4 A Simple Partition

5 A partition can be more or less refined

6

7

8 Partition A partition is the drawing of a (typically complex) fiat boundary over a certain domain

9 Artist’s Grid

10 Transparency A partition is transparent It leaves the world exactly as it is

11 Extension of Partitions via enlargement of domain (via gluing of partitions) via refinement via Cartesian product

12 Artist’s Grid

13 Label/Address System A partition typically comes with labels and an address system

14 Cerebral Cortex

15 Mouse Chromosome Five

16 Montana

17 A partition can comprehend the whole of reality

18 Universe

19 Universe

20 It can do this in different ways

21 Periodic Table

22 Perspectivalism Different partitions may represent cuts through the same reality which are skew to each other

23 Universe/Periodic Table

24 Fiat Fiat objects determined by partitions

25 Kansas

26 France

27 Bona Fide Bona fide objects

28 California Land Cover

29 Lake Tahoe Land Cover Form / Matter

30 Fiat vs bona fide The fiat boundaries which constitute a partition may or may not correspond to bona fide boundaries on the side of the objects in the domain of the partition

31 Fiat vs bona fide but since each partition is transparent (veridical) its fiat boundaries will correspond at least to fiat boundaries on the side of the objects in its domain

32 Partitions vs. 0bjects Partitions are artefacts of our cognition (of our theorizing, classifying, mapping activity)

33 Alberti’s Grid c.1450

34 Sets, groupings, mereological fusions, tesselations belong not to the realm of objects but to the realm of partitions

35 we have all been looking in the wrong direction

36 Dürer Reverse

37 Intentionality

38 Intentionality

39 Lakoff’s Big Error the road to idealism

40 Lakoff’s Big Error

41 Objects and cells objects are located in cells as guests are located in hotel rooms: L A (x, z) x  A :=  z (L A (x, z) object x is recognized by partition A

42 Defining  Sets are (at best) special cases of partitions

43 Set as List Partition A set is a list partition (it is, roughly, a partition minus labels and address system) The elements exist within the set without order or location —they can be permuted at will and the set remains identical

44 Against models transparent partitions vs. models and sets

45 Set Intentionality

46 D Lewis on Sets Set theory rests on one central relation: the relation between element and singleton. Sets are mereological fusions of their singletons (Lewis, Parts of Classes, 1991) But the relation between an element and its singleton is, as Lewis notes, “enveloped in mystery”

47 Mystery Lewis:... since all classes are fusions of singletons, and nothing over and above the singletons they’re made of, our utter ignorance about the nature of the singletons amounts to utter ignorance about the nature of classes generally.

48 L(x, z) An object can be located in a cell within a partition in any number of ways: – object x exemplifies kind K – object x possesses property P – object x falls under concept C – object x is in location L

49 –object x is a member of population P L(x, z) – object x has an observable attribute v in range R (of soil fertility, foliage density, exposure to sunlight, etc.) – object x is in ecological niche N L(x, z)

50 Cells form a partial order z  A z' := cell z is a sub-cell of the cell in partition A (compare: dog as sub-cell of mammal) not equivalent to  x(x  z  x  z' )

51 Empty Set Partition theory has no counterpart of the empty set Periodic Table

52 Union fails 1 We do not have z 1, z 2  A  z 1  z 2  A Consider: z 1 = Germany z 2 = France A = partition of states

53 Union fails 2 We do not have x 1, x 2  A  x 1  x 2  A Consider: x 1 = my cat Plato x 2 = your dog Aristotle A = the partition of the mammals

54 Better than Sets even in spite of all of these problems partitions are