|
|
Viewing Message
|
|
|
| ``Re: Update: "Trans-inductive Posets" (= well-founded posets)''
by Schneemann on 2006-02-26 22:05:56 |
|
| blubb. "Let (L, <) be a poset."
ok.. but it will be interesting to find a different wording that generalizes to arbitrary binary relations (or with only a subset of the partial ordering axioms). "The induction in a directed graph (a binary relation can be seen as such) works if and only if ..." I'll think about that. |
| | [ reply | up | top ] | |
|
|
|
|
|
|
|