The Equivalence Theorem: First-Class Relationships for Structurally Complete Database Systems

Matthew Alford

We prove The Equivalence Theorem: structurally complete knowledge representation requires exactly four mutually entailing capabilities -- n-ary relationships with attributes, tempo…