(Enter summary)
Abstract: Interpolation does not hold for first order arithmetic, but this does not affect modularization theorem
due to Maibaum and Turski (dealing with pushouts of conservative extensions) for theories containing
arithmetic, since this theorem does not in fact use Interpolation Theorem. We present a short proof of
modularization theorem for the case of refinements which can substitute predicates by arbitrary formulas.
This proof uses interpolation in an essential way.
1 Interpolation Theorem and... (Update)
Active bibliography (related documents): More All
0.3: The Proteus System for the Development of Parallel.. - Goldberg, Prins.. (1994)
(Correct)
0.3: A note on Robinson consistency lemma - Aiguier, Schobbens (2006)
(Correct)
0.1: Proof theoretical strength of Martin-Löf Type Theory with W-type.. - Setzer (1993)
(Correct)
Similar documents based on text: More All
0.2: Some Combinatorics behind Proofs - Carbone Octob Er (1995)
(Correct)
0.2: Modularization of XHTML - Candidate Recommendation October (2000)
(Correct)
0.2: Visual Support For The Modularization Of Object-Oriented Systems - Hofmann, Trilk
(Correct)
BibTeX entry: (Update)
@misc{ mints-modularization,
author = "G. Mints",
title = "Modularization and Interpolation",
url = "citeseer.ist.psu.edu/mints98modularization.html" }
Citations (may not include all citations):
12
Survey of proof theory (context) - Kreisel - 1968
3
the modularization theorem for logical specifications (context) - Veloso, Maibaum - 1995
Documents on the same site (http://www.kestrel.edu/HTML/publications.html): More
Domains of Functions - Mints (1998)
(Correct)
Diagrams for Software Synthesis - Jüllig, Srinivas (1993)
(Correct)
Refinement of Parameterized Algebraic Specifications - Srinivas (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC