You are not currently logged in.
Access JSTOR through your library or other institution:
Interpolation in Computing Science: The Semantics of Modularization
Gerard R. Renardel de Lavalette
Vol. 164, No. 3 (Oct., 2008), pp. 437-450
Published by: Springer
Stable URL: http://www.jstor.org/stable/40271082
Page Count: 14
You can always find the topics here!Topics: Interpolation, Logical theorems, Algebra, Mathematical theorems, Logic, Computer science, Modularization, Signatures, Predicates, Computer software
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in several areas of computer science. We give a short overview, and focus on the theory of software systems and modules. An algebra of theories TA is presented, with a nonstandard interpretation of the existential quantifier ∃. In TA, the interpolation property of the underlying logic corresponds with the quantifier combination property ∃Σ ∃П S ≡ ∃(Σ ∪ П) S. It is shown how the Modularization Theorem, the Factorization Lemma and the Normal Form Theorem for module expressions can be proved in TA.
Synthese © 2008 Springer