On Wed, 20 Feb 2008, Pat Hayes wrote:
> ...
>> What do you see as the difference between a tree and a partial
>> ordering?
>
> A tree is a partial order which obeys the extra condition that each
> item has a unique immediate predecessor. (01)
If it has one at all -- trees can have (indeed typically do have)
"roots". Also, trees have to be acyclic (no loops) and connected (you
can get from any node to any other by traversing links); in fact, you
can define a tree to be a connected acyclic graph. (Pat knows all this,
he's just talking fast, as usual. :-) (02)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Subscribe/Config: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (03)
|