Adjoint Typing: Is it Whitehead’s Category of the Ultimate?

Slides:



Advertisements
Similar presentations
Database Design: ER Modelling (Continued)
Advertisements

I-ESA'08 Berlin1 Logical Foundations for the Infrastructure of the Information Market Heather, Michael, Livingstone, David, & Rossiter, Nick, CEIS, Northumbria.
Four-level Architecture for Closure in Interoperability EFIS, 17th-18th July 2003 Nick Rossiter & Michael Heather Informatics, Northumbria University
Copyright © Cengage Learning. All rights reserved.
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.
1 What are Bit Strings? The View from Process Nick Rossiter Northumbria University.
Feb 4: Recap of Jan 30 class Data Models: E-R and Relational (and some others of mostly historical interest) We examined the E-R model –Entities, Relationships,
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Introduction to Computability Theory
1 Introduction to Computability Theory Lecture13: Mapping Reductions Prof. Amos Israeli.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 8 The Enhanced Entity- Relationship (EER) Model.
Theory and Applications
Normal forms for Context-Free Grammars
Lesson 6. Refinement of the Operator Model This page describes formally how we refine Figure 2.5 into a more detailed model so that we can connect it.
Conceptual modelling. Overview - what is the aim of the article? ”We build conceptual models in our heads to solve problems in our everyday life”… ”By.
1 Category Theory in a ( E,M ) -category Some aspects of category theory, in particular related to universality, can be developed in any finitely complete.
Foundations This chapter lays down the fundamental ideas and choices on which our approach is based. First, it identifies the needs of architects in the.
Philosophy A philosophy is a system of beliefs about reality.
CET203 SOFTWARE DEVELOPMENT Session 1B Modelling and the Theory of Inheritance.
UML Class Diagrams: Basic Concepts. Objects –The purpose of class modeling is to describe objects. –An object is a concept, abstraction or thing that.
Data Modeling Using the Entity-Relationship Model
Copyright © Cengage Learning. All rights reserved.
Category Theory By: Ashley Reynolds. HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors,
TSHM Docent Training Session 3 Learning Styles. What kinds of smart are you?
The Semantics of Jitter in Anticipating Time Itself within Nano-Databases Michael Heather and Nick Rossiter CEIS, Northumbria University, Newcastle NE1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 Extending the Number System.
Chapter 2: Reality Modern Metaphysics: Descartes
Multiplying Whole Numbers © Math As A Second Language All Rights Reserved next #5 Taking the Fear out of Math 9 × 9 81 Single Digit Multiplication.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
A Holistic Security Architecture for Distributed Information Systems – A Categorical Approach.
Anticipation as Prediction in the Predication of Data Types Michael Heather and Nick Rossiter CEIS, Northumbria University, Newcastle NE1 8ST
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Semantic Data & Ontologies CMPT 455/826 - Week 5, Day 2 Sept-Dec 2009 – w5d21.
1 The Contravariancy of Anticipatory Systems Dimitrios Sisiaridis, Michael Heather & Nick Rossiter Northumbria University, Newcastle NE2 1XE, UK Symposium.
21st May 2004Informatics Research Conference, Northumbria University 1 Some Fundamental Questions in Databases Nick Rossiter (with Michael Heather)
The Representation of Reality in Computational Form Nick Rossiter Visiting Fellow with Michael Heather and Dimitrios Sisiaridis Computing, Engineering.
Lecture 2: Introduction to Category Theory Nick Rossiter, Computing Science, Newcastle University, England
The Commutative Property Using Tiles © Math As A Second Language All Rights Reserved next #4 Taking the Fear out of Math.
Kherson, May 20-22, Nikolaj S. Nikitchenko Kyiv National Taras Shevchenko University, Ukraine Integration of Informatics-Programming Disciplines.
Copyright © Cengage Learning. All rights reserved.
OBSERVING THE UNIQUENESS OF A CHILD’S INTERPRETATION OF ALLEGORY – BASIC PREMISE FOR BUILDING SKILLS FOR INTERPRETING THE ALLEGORICAL MEANING OF PROVERBS.
1 Typing in Information Systems Nick Rossiter, Michael Heather Computer Science and Digital Technologies Northumbria University, Newcastle NE1 8ST, UK.
Entity-Relation Model. E-R Model The Entity-Relationship (ER) model was originally proposed by Peter in 1976 ER model is a conceptual data model that.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Lecture 4: Handling Heterogeneity with Information Resource Dictionary Systems Nick Rossiter, Computing Science, Newcastle University, England
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
The Greatest Mistake: A Case for the Failure of Hegel’s Idealism.
AREIN, I-ESA March Higher Order Logic and Interoperability in Global Enterprise Heather, Michael, Livingstone, David, & Rossiter, Nick, CEIS, Northumbria.
Development of Whole Numbers next Taking the Fear out of Math © Math As A Second Language All Rights Reserved hieroglyphics tally marks.
Free and Open Systems Theory Nick Rossiter Michael Heather University of Northumbria
The Natural Metaphysics of Computing Anticipatory Systems Michael Heather Nick Rossiter University of Northumbria
THINKING MAPS EDUC 307.  Thinking Maps are eight visual-verbal learning tools, each based on a fundamental thinking process and used together as a set.
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
Models of the OASIS SOA Reference Architecture Foundation Ken Laskey Chair, SOA Reference Model Technical Committee 20 March 2013.
Chapter 1: The cosmological argument AQA Religious Studies: Philosophy of Religion AS Level © Nelson Thornes Ltd 2008 Revision.
© 2014 IBM Corporation The BE 2 model: When Business Events meet Business Entities Fabiana Fournier and Lior Limonad 8 September 2014.
The philosophy of Ayn Rand…. Objectivism Ayn Rand is quoted as saying, “I had to originate a philosophical framework of my own, because my basic view.
WOSC 2008 Wroclaw1 Problems of Interoperability in Information Systems Nick Rossiter and Michael Heather CEIS, Northumbria University, UK
The Enhanced Entity- Relationship (EER) Model
Conceptual Design & ERD Modelling
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Structural relations Carnie 2013, chapter 4 Kofi K. Saah.
UML Class Diagrams: Basic Concepts
Quantum One.
Chapter 7: Data Flow Diagram Structuring System Process Requirements
Conditions for Interoperability
The Process Semantics of Time and Space as Anticipation
Process in the World as a Transaction
Presentation transcript:

Adjoint Typing: Is it Whitehead’s Category of the Ultimate? Michael Heather & Nick Rossiter Northumbria University, UK

Process and Reality An Essay in Cosmology subtitle given by Alfred North Whitehead to his celebrated Gifford lectures: PROCESS & REALITY (PR) at Edinburgh in the session of 1927-28. His cosmology is developed in terms of a Categoreal Scheme Described as his speculative philosophy. The foundation of his whole scheme of cosmology is the Category of the Ultimate. A category in process terms is a typing and this fundamental category of his “expresses the general principle presupposed in the three more special categories”

Structure of Categories These three special categories are composed of eight categories of existence, twenty seven categories of explanation nine ‘categoreal obligations’

At first sight there seems to be a hierarchical typing relationship among these categories which might look like this: Numbers are count of categories of each type

What Whitehead does not say However, Whitehead does not provide such a diagram (nor indeed any diagram in PR). Nor does he state that there is a hierarchical relationship. Whitehead does not even explain what he means by the term ‘category’. It seems it is defined by the Category of the Ultimate itself and therefore is self-referencing. If he has no difficulty with a category being a member of itself, then a category is not to be identified with a set, the concept earlier promoted in his other magnum opus (co-authored with Bertrand Russell) the PRINCIPIA MATHEMATICA (PM).

The Categoreal Scheme Is the Structure of PR Comprising 4 categories Ultimate Existence Explanation Categoreal Obligations The whole of PR rests on this categoreal scheme

Speculative Nature Whitehead seems very conscious of the speculative nature of his philosophy at this stage. The whole of Part I of PR is headed ‘a Speculative Scheme’. It is speculative perhaps because at the time he was giving the Gifford lectures and for the remaining 20 years of his life there was no formal presentation available for PR as he and Russell were able to provide for PM.

Perhaps no longer a speculative philosophy New formal techniques are available So this speculative state of affairs may no longer hold. There is now a formal theory of categories only just beginning at the time of Whitehead’s death in 1947 but now maturing [Heather & Rossiter, Process Category Theory, Salzburg International Whitehead Conference, University of Salzburg, 2006]

CT Foreshadowed by ANW Category Theory is a theory foreshadowed in Whitehead’s Category of the ultimate quite comprehensively in the sense of his preface to PR at p. vi: Motivation for a complete cosmology to construct a system of ideas which bring the aesthetic, moral and religious interest into relation with those concepts of the world which have their origin in natural science. [Whitehead PR Part I]

Problems with Hierarchy From the formal theory of categories Can understand the need for interdependence between categories Not achieved in a hierarchy So Whitehead presumably dismissed the use of hierarchies. The relationship is more complex than the hierarchy in the same way Russell used the phrase ‘ramified type-theory’ rather than ‘hierarchical type-theory’ although both words contain the sense of a tree.

Structure is not simple hierarchy In fact there is a lateral type hierarchy as well as in the vertical. For existence  explanation  obligation A progress in logic from propositional through predicate to modal. Note too that for the third level, Whitehead moves from categories as a noun to the adjective categoreal to qualify obligations. This reveals the horizontal dependence at the semantic level and explains why the hierarchical structure we have drawn above would have been inadequate for Whitehead. For a classical tree structure in set theory requires horizontal independence between atomic entities. Such concepts are neither atomic nor independent. Requirement: these different categories are not independently defined from one another and the relationships go both ways.

The previous diagram might be drawn more fully using the concept of adjointness as below

Properties of Structure This structure is a partial order but that still may not be general enough for the Category of the Ultimate. For partial orders are equivalent to quotients of a preorder which cannot be fully drawn because of their non-reductionist status. However, some idea of the notion may be gleaned from the second diagram There is no obvious starting or finishing point, that is top or bottom, as the Category of the Ultimate may be either, depending on the viewpoint.

Adjointness in more detail For F:L R and G:R  L F,G are Functors L, R are Categories F┤G that is F is left adjoint to G If we can define Unit of adjunction η: L  GFL Counit of adjunction ε: FGR  R Commuting diagrams involving η, ε, F, G Where L,R are objects in L,R respectively F is a free functor (creativity) with change η G is an underlying functor (applies rules) with change ε Special case No change in η or ε then equivalence relationship between F and G

Adjointness -- Motivation Adjointness between functors provides a formal basis for relationships which for applied ct escapes the clutches of Gödel’s undecidability to provide a metaphysical approach to higher-order logic. enables relationships to be specified that are ‘less than’ equivalence but which are common in real world e.g. language translation is natural with respect to composition

Cartesian Closed Categories Cartesian Closed Categories (CCC) are regarded as basic constructions. These have: initial and terminal objects Initial provides entry point giving identity functor Limits and colimits exist as structure bounded all products basis of relationships exponentiation one path CCC are regarded as minimal specification for reality

View of CCC as adjunction CCC is an adjoint relationship between functors F and G: F ┤ G where Free functor F creates binary products Underlying functor G checks for exponentials (one path)

Two Process Techniques Two formal constructions for adjunctions both involve composition: the first that of distinct functors giving 2-cells, the second that of endofunctors giving monads/comonads.

2-cells 2-cells represents composition across a number of levels. For example we may compose data in turn with metadata and metameta data so that the adjoint relationship is represented across four levels of category. That is three levels of mapping, from data values to data abstractions such as aggregation and inheritance.

Monads Monads represents the process or behaviour of a system through three cycles of an endofunctor (same source and target) e.g. GF is an endofunctor Similar to information system transactions The monadic structure has a particular robustness with respect to Gödel's theorems. Monadic higher-order functions are complete and decidable unlike dyadic higher-order ones. Also dual comonad with endofunctor FG

Principles of Monads Represent behaviour Employ three cycles T  T2  T3 Defined as a 3-tuple: <T, η, μ> where T is GF (endofunctor) η is unit of adjunction (defines change in source category on one cycle, measures creativity) μ is multiplication (looks back T2  T, measures creativity)

Principles of Comonads As for monads but tuple is: <S, ε, δ> where S is FG (endofunctor) ε is counit of adjunction (defines change in target category on one cycle) δ is comultiplication (looks forward S  S2, anticipation, in conjunction with monad)

Monad/Comonad Relationship Between monad <T, η, μ> and comonad <S, ε, δ> Functor F takes monad to comonad Functor G takes comonad to monad There is adjointness F ┤ G

Categories are LCCC If Whitehead’s categories represent the real world they are Cartesian Closed (CCC) with products, limits and colimits. They are also Locally Cartesian Closed (LCCC) with the following relationship holding between categories L and R in the context of the three functor categories Existence, Explanation and Obligation.

C LXC R In standard terms the functors are identifiable respectively with the existential quantifier, the pullback functor and the universal quantifier. LXC R is the relationship of L with R in the context of C C includes L + R

Category of Ultimate We can then write the Category of the Ultimate as: Existence ┤ Explanation ┤ Obligation where the reverse logic gate ┤distinguishes the left from the right adjoint

Concluding Remark by Whitehead Whitehead concludes the section of his Preface quoted above with: The doctrine of necessity in universality means that there is an essence to the universe which forbids relationships beyond itself, as a violation of its rationality. Speculative philosophy seeks that essence [Whitehead PR, Part I, Chapter I Speculative Philosophy, Section I p.4, The Speculative Scheme].

Defining ‘God’ Whitehead is in effect defining ‘God’, the ultimate limit which for Cartesian Closed Categories constitutes the boundaries of a relationship or process bringing ‘the aesthetic, moral and religious interest into relation with those concepts of the world which have their origin in natural science’.

Future Work Consider taking Whitehead’s concepts and representing them in ct directly Useful exercise Possible trap of categorification Approach here has been to show the potential of ct for representing processes and relationships, including aspects such as adjoint relations, creativity, anticipation, looking back, identity and limits.