On a generalized modularization theorem

DOI10.1016/S0020-0190(00)00037-5zbMath1003.68079OpenAlexW1968887319MaRDI QIDQ1607048

Theodosis Dimitrakos, Thomas S. E. Maibaum

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00037-5

zbMATH Keywords

pushoutfaithful morphisms

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Interpolation, preservation, definability (03C40)

Related Items (13)

Interpolation in Grothendieck institutions ⋮ Generalized interpolation in CASL ⋮ An institution-independent proof of the Robinson consistency theorem ⋮ Interpolation for predefined types ⋮ An axiomatic approach to structuring specifications ⋮ The institution-theoretic scope of logic theorems ⋮ An institution-independent proof of the Beth definability theorem ⋮ A semantic approach to interpolation ⋮ Interpolation in computing science: The semantics of modularization ⋮ On what exactly goes on when software is developed step-by-step. II: The sequel ⋮ Abstract Beth definability in institutions ⋮ On local modularity and interpolation in entailment systems. ⋮ Generalised graded interpolation

Cites Work

• On the Modularization Theorem for logical specifications
• Amalgamation and interpolation in the category of Heyting algebras
• On pushout consistency, modularity and interpolation for logical specifications
• Undecidable theories
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• Module algebra
• On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
• A survey of proof theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a generalized modularization theorem