On the Modularization Theorem for logical specifications

The Modularization Property is a basic tool for guaranteeing the preservation of modular structure under refinements and its importance has been noted by several researchers. In the context of logical specifications, i.e. those presented by sets of first-order sentences of a (possibly many-sorted) language, the role played by the Modularization Property is examined and a proof of the Modularization Theorem is presented.