| Subject: | Re: Every set can be ... ordered? |
|---|---|
| From: | "MoeBlee" |
| Date: | 26 Aug 2006 13:44:12 -0700 |
| Newsgroups: | sci.logic |
tchow@xxxxxxxxxxxxx wrote: > Surely the empty set is always a > partial ordering on X. If there is a difference between 'of' and 'on', I mean a partially ordering OF x. I.e., there is a reflexive, antisymmetric, and transitive relation R such that the field of R is x. Isn't that what we mean by 'there is a partial ordering of x', or 'x is partially ordered', or 'x has a partial ordering'? MoeBlee |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: Propositional calculus, wit |
|---|---|
| Next by Date: | Re: Proofs to programs, Charlie-Boo |
| Previous by Thread: | Re: Every set can be ... ordered?, tchow |
| Next by Thread: | Re: Every set can be ... ordered?, Rupert |
| Indexes: | [Date] [Thread] [Top] [All Lists] |