HOME

TheInfoList



OR:

In mathematics, point-free geometry is a
geometry Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is ...
whose primitive
ontological In metaphysics, ontology is the philosophical study of being, as well as related concepts such as existence, becoming, and reality. Ontology addresses questions like how entities are grouped into categories and which of these entities ex ...
notion is ''
region In geography, regions, otherwise referred to as zones, lands or territories, are areas that are broadly divided by physical characteristics (physical geography), human impact characteristics (human geography), and the interaction of humanity and t ...
'' rather than point. Two
axiomatic system In mathematics and logic, an axiomatic system is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems. A theory is a consistent, relatively-self-contained body of knowledge which usually contai ...
s are set out below, one grounded in
mereology In logic, philosophy and related fields, mereology ( (root: , ''mere-'', 'part') and the suffix ''-logy'', 'study, discussion, science') is the study of parts and the wholes they form. Whereas set theory is founded on the membership relation bet ...
, the other in
mereotopology In formal ontology, a branch of metaphysics, and in ontological computer science, mereotopology is a first-order theory, embodying mereological and topological concepts, of the relations among wholes, parts, parts of parts, and the boundaries bet ...
and known as ''connection theory''. Point-free geometry was first formulated in Whitehead (1919, 1920), not as a theory of
geometry Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is ...
or of
spacetime In physics, spacetime is a mathematical model that combines the three dimensions of space and one dimension of time into a single four-dimensional manifold. Spacetime diagrams can be used to visualize relativistic effects, such as why differen ...
, but of "events" and of an "extension relation" between events. Whitehead's purposes were as much
philosophical Philosophy (from , ) is the systematized study of general and fundamental questions, such as those about existence, reason, knowledge, values, mind, and language. Such questions are often posed as problems to be studied or resolved. Some s ...
as scientific and mathematical.


Formalizations

Whitehead did not set out his theories in a manner that would satisfy present-day canons of formality. The two formal first-order theories described in this entry were devised by others in order to clarify and refine Whitehead's theories. The
domain of discourse In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range. Overview The domai ...
for both theories consists of "regions." All unquantified variables in this entry should be taken as tacitly
universally quantified In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any" or "for all". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other ...
; hence all axioms should be taken as universal closures. No axiom requires more than three quantified variables; hence a translation of first-order theories into
relation algebra In mathematics and abstract algebra, a relation algebra is a residuated Boolean algebra expanded with an involution called converse, a unary operation. The motivating example of a relation algebra is the algebra 2''X''² of all binary relations ...
is possible. Each set of axioms has but four
existential quantifier In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, whe ...
s.


Inclusion-based point-free geometry (mereology)

The fundamental primitive
binary relation In mathematics, a binary relation associates elements of one set, called the ''domain'', with elements of another set, called the ''codomain''. A binary relation over sets and is a new set of ordered pairs consisting of elements in and i ...
is ''inclusion'', denoted by
infix An infix is an affix inserted inside a word stem (an existing word or the core of a family of words). It contrasts with ''adfix,'' a rare term for an affix attached to the outside of a stem, such as a prefix or suffix. When marking text for int ...
"≤", which corresponds to the binary ''Parthood'' relation that is a standard feature in mereological theories. The intuitive meaning of ''x'' ≤ ''y'' is "''x'' is part of ''y''." Assuming that equality, denoted by infix "=", is part of the background logic, the binary relation ''Proper Part'', denoted by infix "<", is defined as: :x The axioms are: *Inclusion partially orders the
domain Domain may refer to: Mathematics *Domain of a function, the set of input values for which the (total) function is defined ** Domain of definition of a partial function ** Natural domain of a partial function ** Domain of holomorphy of a function * ...
. :G1. x \le x. ( reflexive) :G2. (x \le z \land z \le y) \rightarrow x \le y. ( transitive) WP4. :G3. (x \le y \land y \le x) \rightarrow x = y. ( antisymmetric) *Given any two regions, there exists a region that includes both of them. WP6. :G4. \exists z \le z \land y\le z *Proper Part densely orders the
domain Domain may refer to: Mathematics *Domain of a function, the set of input values for which the (total) function is defined ** Domain of definition of a partial function ** Natural domain of a partial function ** Domain of holomorphy of a function * ...
. WP5. :G5. x *Both atomic regions and a universal region do not exist. Hence the
domain Domain may refer to: Mathematics *Domain of a function, the set of input values for which the (total) function is defined ** Domain of definition of a partial function ** Natural domain of a partial function ** Domain of holomorphy of a function * ...
has neither an upper nor a lower bound. WP2. :G6. \exists y \exists z * Proper Parts Principle. If all the proper parts of ''x'' are proper parts of ''y'', then ''x'' is included in ''y''. WP3. :G7. \forall z \rightarrow x\le y. A model of G1–G7 is an ''inclusion space''. Definition (Gerla and Miranda 2008: Def. 4.1). Given some inclusion space S, an abstractive class is a class ''G'' of regions such that ''S\G'' is
totally ordered In mathematics, a total or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation \leq on some set X, which satisfies the following for all a, b and c in X: # a \leq a ( reflexiv ...
by inclusion. Moreover, there does not exist a region included in all of the regions included in ''G''. Intuitively, an abstractive class defines a geometrical entity whose dimensionality is less than that of the inclusion space. For example, if the inclusion space is the
Euclidean plane In mathematics, the Euclidean plane is a Euclidean space of dimension two. That is, a geometric setting in which two real quantities are required to determine the position of each point ( element of the plane), which includes affine notions of ...
, then the corresponding abstractive classes are points and
line Line most often refers to: * Line (geometry), object with zero thickness and curvature that stretches to infinity * Telephone line, a single-user circuit on a telephone communication system Line, lines, The Line, or LINE may also refer to: Art ...
s. Inclusion-based point-free geometry (henceforth "point-free geometry") is essentially an axiomatization of Simons's (1987: 83) system W. In turn, W formalizes a theory in Whitehead (1919) whose axioms are not made explicit. Point-free geometry is W with this defect repaired. Simons (1987) did not repair this defect, instead proposing in a footnote that the reader do so as an exercise. The primitive relation of W is Proper Part, a
strict partial order In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binar ...
. The theory of Whitehead (1919) has a single primitive binary relation ''K'' defined as ''xKy'' ↔ ''y'' < ''x''. Hence ''K'' is the
converse Converse may refer to: Mathematics and logic * Converse (logic), the result of reversing the two parts of a definite or implicational statement ** Converse implication, the converse of a material implication ** Converse nonimplication, a logical ...
of Proper Part. Simons's WP1 asserts that Proper Part is
irreflexive In mathematics, a binary relation ''R'' on a set ''X'' is reflexive if it relates every element of ''X'' to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal t ...
and so corresponds to G1. G3 establishes that inclusion, unlike Proper Part, is antisymmetric. Point-free geometry is closely related to a
dense linear order In mathematics, a partial order or total order < on a set X is said to be dense if, for all x and y in X
D, whose axioms are G1-3, G5, and the totality axiom x \le y \lor y \le x.Stoll, R. R., 1963. ''Set Theory and Logic''. Dover reprint, 1979. P. 423. Hence inclusion-based point-free geometry would be a proper extension of D (namely D ∪ ), were it not that the D relation "≤" is a
total order In mathematics, a total or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation \leq on some set X, which satisfies the following for all a, b and c in X: # a \leq a ( reflexi ...
.


Connection theory (mereotopology)

A different approach was proposed in Whitehead (1929), one inspired by De Laguna (1922). Whitehead took as primitive the
topological In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing ...
notion of "contact" between two regions, resulting in a primitive "connection relation" between events. Connection theory C is a
first-order theory First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...
that distills the first 12 of the 31 assumptions in chapter 2 of part 4 of ''Process and Reality'' into 6 axioms, C1-C6. C is a proper fragment of the theories proposed in Clarke (1981), who noted their mereological character. Theories that, like C, feature both inclusion and topological primitives, are called mereotopologies. C has one primitive relation, binary "connection," denoted by the
prefix A prefix is an affix which is placed before the stem of a word. Adding it to the beginning of one word changes it into another word. For example, when the prefix ''un-'' is added to the word ''happy'', it creates the word ''unhappy''. Particula ...
ed predicate letter ''C''. That ''x'' is included in ''y'' can now be defined as ''x'' ≤ ''y'' ↔ ∀z 'Czx''→''Czy'' Unlike the case with inclusion spaces, connection theory enables defining "non-tangential" inclusion, a total order that enables the construction of abstractive classes. Gerla and Miranda (2008) argue that only thus can mereotopology unambiguously define a point. The axioms C1-C6 below are, but for numbering, those of Def. 3.1 in Gerla and Miranda (2008): *''C'' is reflexive. C.1. :C1. \ Cxx. *''C'' is
symmetric Symmetry (from grc, συμμετρία "agreement in dimensions, due proportion, arrangement") in everyday language refers to a sense of harmonious and beautiful proportion and balance. In mathematics, "symmetry" has a more precise definit ...
. C.2. :C2. Cxy\rightarrow Cyx. *''C'' is extensional. C.11. :C3. \forall z zx \leftrightarrow Czy\rightarrow x = y. * All regions have proper parts, so that C is an atomless theory. P.9. :C4. \exists y *Given any two regions, there is a region connected to both of them. :C5. \exists z zx\land Czy *All regions have at least two unconnected parts. C.14. :C6. \exists y \exists z y\le x)\land (z\le x)\land\neg Cyz A model of C is a ''connection space''. Following the verbal description of each axiom is the identifier of the corresponding axiom in Casati and Varzi (1999). Their system SMT (''strong mereotopology'') consists of C1-C3, and is essentially due to Clarke (1981). Any mereotopology can be made atomless by invoking C4, without risking paradox or triviality. Hence C extends the atomless variant of SMT by means of the axioms C5 and C6, suggested by chapter 2 of part 4 of ''Process and Reality''. For an advanced and detailed discussion of systems related to C, see Roeper (1997). Biacino and Gerla (1991) showed that every model of Clarke's theory is a
Boolean algebra In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas i ...
, and models of such algebras cannot distinguish connection from overlap. It is doubtful whether either fact is faithful to Whitehead's intent.


See also

*
Mereology In logic, philosophy and related fields, mereology ( (root: , ''mere-'', 'part') and the suffix ''-logy'', 'study, discussion, science') is the study of parts and the wholes they form. Whereas set theory is founded on the membership relation bet ...
*
Mereotopology In formal ontology, a branch of metaphysics, and in ontological computer science, mereotopology is a first-order theory, embodying mereological and topological concepts, of the relations among wholes, parts, parts of parts, and the boundaries bet ...
*
Pointless topology In mathematics, pointless topology, also called point-free topology (or pointfree topology) and locale theory, is an approach to topology that avoids mentioning points, and in which the lattices of open sets are the primitive notions. In this appr ...


Notes


References

{{reflist, 2


Bibliography

*Biacino L., and Gerla G., 1991,
Connection Structures
" ''Notre Dame Journal of Formal Logic'' 32: 242-47. * Casati, R., and Varzi, A. C., 1999. ''Parts and places: the structures of spatial representation''. MIT Press. * Clarke, Bowman, 1981,
A calculus of individuals based on 'connection'
" ''Notre Dame Journal of Formal Logic 22'': 204-18. * ------, 1985,
Individuals and Points
" ''Notre Dame Journal of Formal Logic 26'': 61-75. *De Laguna, T., 1922, "Point, line and surface as sets of solids," ''The Journal of Philosophy 19'': 449-61. * Gerla, G., 1995,
Pointless Geometries
in Buekenhout, F., Kantor, W. eds., ''Handbook of incidence geometry: buildings and foundations''. North-Holland: 1015-31. *--------, and Miranda A., 2008,
Inclusion and Connection in Whitehead's Point-free Geometry
" in
Michel Weber Michel Weber (born 1963) is a Belgian philosopher. He is best known as an interpreter and advocate of the philosophy of Alfred North Whitehead, and has come to prominence as the architect and organizer of an overlapping array of international sc ...
and Will Desmond, (eds.),
Handbook of Whiteheadian Process Thought
', Frankfurt / Lancaster, ontos verlag, Process Thought X1 & X2. *Gruszczynski R., and Pietruszczak A., 2008,
Full development of Tarski's geometry of solids
" ''Bulletin of Symbolic Logic'' 14:481-540. The paper contains presentation of point-free system of geometry originating from Whitehead's ideas and based on Lesniewski's mereology. It also briefly discusses the relation between point-free and point-based systems of geometry. Basic properties of mereological structures are given as well. *Grzegorczyk, A., 1960, "Axiomatizability of geometry without points," ''Synthese 12'': 228-235. *Kneebone, G., 1963. ''Mathematical Logic and the Foundation of Mathematics''. Dover reprint, 2001. * Lucas, J. R., 2000. ''Conceptual Roots of Mathematics''. Routledge. Chpt. 10, on "prototopology," discusses Whitehead's systems and is strongly influenced by the unpublished writings of David Bostock. * Roeper, P., 1997, "Region-Based Topology," ''Journal of Philosophical Logic 26'': 251-309. * Simons, P., 1987. ''Parts: A Study in Ontology''. Oxford Univ. Press. * Whitehead, A.N., 1916, "La Theorie Relationiste de l'Espace," ''Revue de Metaphysique et de Morale 23'': 423-454. Translated as Hurley, P.J., 1979, "The relational theory of space," ''Philosophy Research Archives 5'': 712-741. *--------, 1919. ''An Enquiry Concerning the Principles of Natural Knowledge''. Cambridge Univ. Press. 2nd ed., 1925. *--------, 1920.
The Concept of Nature
'. Cambridge Univ. Press. 2004 paperback, Prometheus Books. Being the 1919 Tarner Lectures delivered at Trinity College. *--------, 1979 (1929). ''
Process and Reality ''Process and Reality'' is a book by Alfred North Whitehead, in which the author propounds a philosophy of organism, also called process philosophy. The book, published in 1929, is a revision of the Gifford Lectures he gave in 1927–28. Whi ...
''. Free Press. Alfred North Whitehead History of mathematics Mathematical axioms Mereology Ontology Topology