CLOSED LOOP INTERVAL ONTOLOGY
       The Digital Integration of Conceptual Form
TzimTzum/Kaballah | Loop definition | Home | ORIGIN    
Please sign in
or register

Email *

Password *

Home | About

Select display
Show public menu
Show all theme groups
Show all themes
Show all terms
Order results by
Alphabetical
Most recently edited
Progress level
Placeholder
Note
Sketch
Draft
Polished


Searches selected display

The Many Forms of Many/One
Universal conceptual form

Invocation
Aligning the vision

Project under development
Evolving and coalescing

Guiding motivation
Why we do this

A comprehensive vision
Ethics / governance / science

Cybernetic democracy
Homeostatic governance

Collective discernment
Idealized democracy

Objectives and strategy
Reconciliation and integration

Reconciliation of perspectives
Holistic view on alternatives

What is a concept?
Definitions and alternatives

Theories of concepts
Compare alternatives

What is truth?
How do we know?

Semantics
How meaning is created

Synthetic dimensionality
Foundational recursive definition

Universal hierarchy
Spectrum of levels

A universal foundation
The closed loop ensemble contains
all primary definitions

Set
Dimensions of set theory

Numbers
What is a number?

Venn diagrams
Topology of sets

Objects in Boolean algebra
How are they constructed?

Core vocabulary
Primary terms

Core terms on the strip
Closed Loop framework

Graphics
Hierarchical models

Digital geometry
Euclid in digital space

The dimensional construction
of abstract objects
Foundational method

The digital integration
of conceptual form
Compositional semantics

Closed loop interval ontology
How it works

Cognitive science
The integrated science of mind

Equality
What does it mean?

Formal systematic definitions
Core terms

Data structures
Constructive elements
and building blocks

Compactification
Preserving data under transformation

Steady-state cosmology
In the beginning

Semantic ontology
Domain and universal

Foundational ontology
A design proposal

Coordinate systems
Mapping the grid

Articles
From other sources

Arithmetic
Foundational computation

Plato's republic and
homeostatic democracy
Perfecting political balance

Branching computational architecture
Simultaneity or sequence

Abstract math and HTML
Concrete symbolic representation

All knowledge as conceptual
Science, philosophy and math
are defined in concepts

Does the Closed Loop
have an origin?
Emerging from a point


Theme
Scientific realism
Placeholder

Definition / description

our recommendation that ontologies developed for scientific purposes should be constructed in such a way that their terms are seen as referring to what we call universals or types in reality.

1.8. Asserted monohierarchies Inspired in part by (Rector, 2003), we advocate the following:

Principle of asserted single inheritance. Each reference ontology module should be built as an asserted monohierarchy (a hierarchy in which each term has at most one parent).

This means that the ontology will have a single root node, and that all non-root terms will have exactly one is_a parent and thus be connected by exactly one chain of is_a relations to the root. To say that the is_a relations are asserted means that they are included in the ontology manually by the ontology’s developers and form the basis for the associated definitions.

Terms in the resultant asserted hierarchies can be used in various combinations, using relations taken over from the Relation Ontology (RO) (Smith, 2005) to form new terms, following a methodology first applied in relation to the GO and its sister ontologies in Wroe et al. (2003) (compare also Hill et al., 2002; Mungall, 2004). The goal is both to reduce the degree of arbitrariness typically involved in term composition in ontologies, and to ensure that ontologies are developed in tandem in such a way as to constitute a progressively more well-integrated modular network.4 A term such as blood glucose measurement, for example, is formed from FMA:portion of blood, ChEBI:glucose and OBI:act of measurement. When a classifier is applied to the result of adding such a term, with its definition, to the already existing set of asserted monohierarchies, then certain further is_a relations will be able to be inferred. This will in some cases yield a polyhierarchy, or in other words a hierarchy in which some terms will have more than one is_a parent (hence ‘multiple inheritance’ – meaning that the entities represented by a term with multiple parents will inherit a corresponding set of attributes from each of its parents).

Rector (2003) has developed a methodology for ‘normalizing’ ontologies by decomposing existing polyhierarchies into homogeneous disjoint monohierarchies. For him, the monohierarchies are then recombined using logical definitions from which an enriched poly-hierarchy can be inferred mechanically using a theorem prover or reasoner.

Hide Placeholder Note Sketch Draft Polished

Tue, Feb 16, 2021