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 - Partially ordered group - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2014-06-09 10:17:14 Open Document File Size: 67,86 KB Share Result on Facebook SocialTag Binary relation Hasse diagram Presentation of a group Differential equation Function Szpilrajn extension theorem Ancestral relation Mathematics Order theory Partially ordered set

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 mAdd to Reading List