Szpilrajn extension theorem

Results: 1



#Item
11997 Paper 1 Question 7 Discrete Mathematics Let us say that a finite partial order (A, v) is tree-like if, for every a ∈ A, the set (of its predecessors) {x ∈ A | x v a ∧ x 6= a} either is empty or has a unique m

1997 Paper 1 Question 7 Discrete Mathematics Let us say that a finite partial order (A, v) is tree-like if, for every a ∈ A, the set (of its predecessors) {x ∈ A | x v a ∧ x 6= a} either is empty or has a unique m

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2014-06-09 10:17:14