Closure of a Set of Functional Dependencies Given a set F of functional dependencies,there are certain other functional dependencies that are logically implied by F. For example:If A->B and B->C,then we can infer that A->C The set of all functional dependencies logically implied by F is the closure of F. We denote the closure of F by F+. F+is a superset of F. Database System Concepts-5th Edition,Oct 5,2006 7.16 @Silberschatz,Korth and SudarshanDatabase System Concepts - 5 7.16 ©Silberschatz, Korth and Sudarshan th Edition, Oct 5, 2006 Closure of a Set of Functional Dependencies Given a set F of functional dependencies, there are certain other functional dependencies that are logically implied by F. For example: If A → B and B → C, then we can infer that A → C The set of all functional dependencies logically implied by F is the closure of F. We denote the closure of F by F+. F+ is a superset of F