Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!olivea!uunet!shelby!neon!crew
From: crew@CS.Stanford.EDU (Roger Crew)
Newsgroups: comp.theory
Subject: Re: Name for a Relation?
Message-ID: <1991Feb9.000807.11653@Neon.Stanford.EDU>
Date: 9 Feb 91 00:08:07 GMT
References: <824@mephisto.edu>
Sender: news@Neon.Stanford.EDU (USENET News System)
Organization: Standard Input
Lines: 14
In-Reply-To: gil@daffy.gatech.edu's message of 8 Feb 91 21:12:18 GMT

In article <824@mephisto.edu> gil@daffy.gatech.edu (Gil Neiger) writes:
> 
> I am dealing with a kind of relation and I'm wondering if there's
> a name for it.  It's a[n irreflexive partial order < such that]
> "not related" relation | [i.e., (p | q) iff (not(p < q) and not(q < p))]
> is an equivalence [relation].... Is there a name for the relation "<"?

I'd call it the complemented transpose of a total preorder
(<@, as defined by p <@ q === not(q<p), is reflexive, transitive, and total).

--
Roger Crew
Usenet:    {arpa gateways, decwrl, uunet, rutgers}!cs.stanford.edu!crew
Internet:  crew@CS.Stanford.EDU