# Lisp AI

## Thursday, June 30, 2016

### Families of kuratowski pairs

Families of kuratowski pairs which are set systems that define a pair between two elements fully characterize correspondences between sets. It is by using families of kuratowski pairs that we can deal with questions of relation algebra. Each family of kuratowski pairs necessarily has rank at most two because each kuratowski pair has a maximum cardinality of two. This means that these are rank limited set systems.

## Wednesday, June 15, 2016

### The rank of set systems

Given a set of sets then the rank of that set system is the maximum cardinality of the sets it contains as members. We can determine certain characteristics of a set system based upon their rank. Set systems of rank at most one are rank complete which means they are like a set which may or may not contain the empty set. Set systems of rank at most two include as a particular case set systems that define comparability. This process can be extended further to determine properties of the rank of higher set systems.

The rank property can also be used to understand sets of sets of sets. Given a sets of sets of sets then the rank is the maximum cardinality of a set of sets contained in the set of sets of sets. We can deduce that families of kuratowski pairs necessarily have a rank of at most two because the pairs never have more then two members. The families of kuratowski pairs effectively generalize correspondences between sets. Kuratowski pairs also have the property that their union has at most two elements so the rank of the set of unions is at most two which makes the ranking property even stronger for them.

The rank property can also be used to understand sets of sets of sets. Given a sets of sets of sets then the rank is the maximum cardinality of a set of sets contained in the set of sets of sets. We can deduce that families of kuratowski pairs necessarily have a rank of at most two because the pairs never have more then two members. The families of kuratowski pairs effectively generalize correspondences between sets. Kuratowski pairs also have the property that their union has at most two elements so the rank of the set of unions is at most two which makes the ranking property even stronger for them.

## Wednesday, May 25, 2016

### Relation algebra

We can establish a theory of binary relations in terms of their ordering as well as composition and transposition. The composition of binary relations generalizes the notion of composition of functions. Functional binary relations merely have a functional dependency from their input argument to the output argument. The inverse functional binary relations are their transpose. One to one binary relations are both functional and inverse functional. The composition of one to one binary relations is a one to one binary relation. Symmetric binary relations are equal to their transposition. The involutions are symmetric as well as functional. These properties allow us to better understand binary relations in terms of composition and transposition.

## Saturday, March 12, 2016

### Incidence order of graphs

The incidence order of a graph is a type of partial order that forbids three different partial orders [1 1 1], [2 2], and [3 1]. If these three partial orders are forbidden as suborders then the partial order may be embedded in the incidence order of a graph. This defines the suborder closure of the class of incidence orders of graphs. In order for a partial order to be an incidence order of a graph all of its non-minimal elements must also have exactly two parts.

If this final condition is met then the join representations of the partial order correspond to a dependency family. There is a complementary condition produced by the transposition of the incidence order of a graph. Only those graphs which have locally at most two elements meet this suborder condition in their transposition. All graphs can be produced from the join representations of a partial order that meets these conditions.

If this final condition is met then the join representations of the partial order correspond to a dependency family. There is a complementary condition produced by the transposition of the incidence order of a graph. Only those graphs which have locally at most two elements meet this suborder condition in their transposition. All graphs can be produced from the join representations of a partial order that meets these conditions.

## Saturday, January 2, 2016

### 2015 year in review

Within the year 2015 it was realized that it can be useful to study pure set theory. By studying pure set theory we are also dealing with pure ontology. We are classifying sets entirely in terms of their own properties as sets. We can use set systems in order to define preorder containment families and alexandrov families which correspond to one another. We can also define dependency families in accordance with this process. Dependency families can be defined as the join representations of certain preorder containment families.
Though we can deal with sets of sets as a particular case we can also deal with sets of sets of sets. These allows us to deal with structures which we could not effectively define simply with sets of sets. In this way we are still dealing with pure ontology as we are defining sets entirely in terms of sets. As we create a pure ontology dealing with sets and classes defined entirely in terms of themselves we can later extend this ontology to deal with particulars but in the end the pure ontology is the foundation of this.

## Monday, August 31, 2015

### Threshold graphs and interval orders

Threshold graphs like interval orders have the property that each element is determined by some vertex invariant in all substructures. In threshold graphs all elements are determined by degree. In interval orders all elements are determined entirely by their interval representations. Both of these properties are maintained in forbidden substructures of each of these structures. Weak orders are the special class of interval orders whose elements are determined in terms of degrees. Threshold orders are interval orders with threshold comparability.

## Saturday, May 30, 2015

### Weakly chordal graphs

The weakly chordal graphs are a subclass of the perfect graphs that exclude all holes and antiholes. The weakly chordal graphs are an important class of graphs in order theory. Well the class of weakly chordal graphs does not include all comparability graphs or all cocomparability graphs it does include all permutation graphs which are the graphs that are both comparability and cocomparability. This means it also includes the cographs which also happen to be permutation graphs.

The chordal graphs as well as their complements the cochordal graphs are weakly chordal. The trivially perfect graphs are precisely those graphs that are both chordal and cographs. The cotrivially perfect graphs are precisely those graphs that are both cochordal and cographs. The trivially perfect graphs and the cotrivially perfect graphs can both be expressed entirely in terms of preorders. Only weakly chordal graphs can be described entirely in terms of preorders in this sense.

The chordal graphs as well as their complements the cochordal graphs are weakly chordal. The trivially perfect graphs are precisely those graphs that are both chordal and cographs. The cotrivially perfect graphs are precisely those graphs that are both cochordal and cographs. The trivially perfect graphs and the cotrivially perfect graphs can both be expressed entirely in terms of preorders. Only weakly chordal graphs can be described entirely in terms of preorders in this sense.

Subscribe to:
Posts (Atom)