Symbolic and logic computation systems ranging from computer algebra systems to theorem provers are finding their way into science, technology, mathematics and engineering. But such systems rely on explicitly or implicitly represented mathematical knowledge that needs to be managed to use such systems effectively.While mathematical knowledge management (MKM) "in the small " is wellstudied, scaling up to large, highly interconnected corpora remains difficult. We hold that in order to realize MKM "in the large", we need representation languages and software architectures that are designed systematically with largescale processing in mind.Therefore, we have designed and implemented the Mmt language -a module system for mathematical theories. Mmt is designed as the simplest possible language that combines a module system, a foundationally uncommitted formal semantics, and web-scalable implementations. Due to a careful choice of representational primitives, Mmt allows us to integrate existing representation languages for formal mathematical knowledge in a simple, scalable formalism. In particular, Mmt abstracts from the underlying mathematical and logical foundations so that it can serve as a standardized representation format for a formal digital library. Moreover, Mmt systematically separates logic-dependent and logic-independent concerns so that it can serve as an interface layer between computation systems and MKM systems. 1 We have already solved the integration of formal and informal mathematical knowledge in the OMDoc format, whose formal part is a predecessor of the work presented in this paper. We plan to integrate this solution with the much stronger formal basis of Mmt in the future.Corresponding to the notions of structural and semantic validation, we can define structural and semantic equivalence of theory graphs:Definition 34. Relative to a fixed foundation, two well-formed theory graphs γ and γ ′ are called structurally equivalent if the following holds:• γ > T = { } iff γ ′ > T = { }, and in that case T has meta-theory M in γ iff it does so in γ ′ ,• γ ≫ l : S → T = iff γ ′ ≫ l : S → T = ,