Interpolation in Computing Science: The Semantics of Modularization

Synthese 164 (3):437 - 450 (2008)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2011-05-29

Downloads
17 (#872,413)

6 months
7 (#438,648)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references