Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
UPDATE