Renardel de Lavalette. Logical semantics of modularisation. In CSL: 5th Workshop on Computer Science Logic. LNCS, Springer-Verlag, 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Information Algebras and Consequence Operators - Kohlas, Stärk (1998) (Correct)
....without axioms. It is defined as follows: T(#) #C# (#) ##. Again, the axioms of an information algebra are satisfied. This time, however, they are not as obvious as in the case of relational databases. The proof of the combination axiom, for example, requires Craig s interpolation theorem [1, 5]. We have: 1) M 1 M 2 ) M 3 = M 1 (M 2 M 3 ) associativity] 2) M N = N M [commutativity] 3) S(M N) S(M) # S(N) labeling] 4) S(T(#) # (5) If S(M) #, then M T(#) M . neutral element] 6) If # # S(M ) then S(# # M) #. 7) If # # # # S(M ) then # # (# # M) ....
....consequence operator has the interpolation property. In the context of algebraic specifications and the algebra of modules Renardel de Lavalette has shown that certain axioms, expressing that modules communicate through their visible parts only, are equivalent to an interpolation property [5]. Di#erent versions of interpolation and modularity have been compared by Veloso [9, 10] The next question is, whether we can find a similar property that is equivalent to condition (C6) This problem is harder. We have no definite solution. At least we can give some natural conditions on a ....
G. R. Renardel de Lavalette. Logical semantics of modularisation. In E. Borger, G. Jager, H. Kleine Buning, and M. M. Richter, editors, Computer Science Logic, selected papers from CSL '91, pages 306--315. Springer-Verlag, Lecture Notes in Computer Science 626, 1992.
Interpolation in Practical Formal Development - Bicarregui, Dimitrakos (2000) (1 citation) (Correct)
....common ff; fi; # are sentences. generalised ff; fi; # are sets of sentences, is a sentence. arrow ) denotes an implication connective. turnstile ) denotes entailment. Figure 1: The various variants of interpolation emphasise on different aspects of a common meta logical property. and [33]) Detailed proofs for unsorted first order logic were given in [47] and in [48] An analogously strong correspondence between ordinary interpolation and amalgamation of models (which leads to the stability of conservativeness in the amalgamation of a span of conservative extensions a special ....
Renardel de Lavalette. Logical semantics of modularisation. In CSL: 5th Workshop on Computer Science Logic. LNCS, Springer-Verlag, 1991.
Interpolation in Practical Formal - Development Juan Bicarregui (Correct)
No context found.
Renardel de Lavalette. Logical semantics of modularisation. In CSL: 5th Workshop on Computer Science Logic. LNCS, Springer-Verlag, 1991.
Interpolation in Practical Formal - Development Juan Bicarregui (Correct)
No context found.
Renardel de Lavalette. Logical semantics of modularisation. In CSL: 5th Workshop on Computer Science Logic. LNCS, Springer-Verlag, 1991.
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