Renardel de Lavalette, G. (1989). Modularisation, parametrisation and interpolation. J. Inf. Process. Cybern. EIK, 25(5/6):283-- 292. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Failure of Interpolation in Combined Modal Logics - Maarten Marx Carlos (1999) (5 citations) (Correct)
....2 has a model. The property is not only intuitively valid for scientific reasoning, it also has practical (and computational) consequences. In practice it shows up in the incremental design, specification and development of software, and has received quite some attention in that community (cf. [MS84, Ren89]. Below we will give a more technical reason why interpolation is desirable: it can help in showing that irreflexivity style rules in an unorthodox axiom system are conservative over the orthodox part. In this paper we look at interpolation in combined modal logics (and we will see that first ....
....notion in modal logic (e.g. every modal logic of an elementary class of frames is compact) AIP and TIP are often referred to as the strong and weak interpolation property, respectively. We note that the splitting interpolation version is the one used in connection with modularisation of programs [MS84, Ren89]. In the rest of the article j= refers always to the global consequence relation. Proof. For (i) use the fact that with the local relation the deduction theorem j= iff j= holds. We prove (ii) for the uni modal case only. The proof extends easily to any modal similarity type. For ....
Renardel de Lavalette, G. Modularisation, parametrisation and interpolation. J. Inf. Process. Cybern. EIK, 25(5/6):283--292, 1989.
Interpolation and Bisimulation in Temporal Logic - Areces, de Rijke (1998) (3 citations) (Correct)
.... nowadays [6] 2 Besides its wide use the area of automatic theorem proving (i.e. 1, 18] the interpolation property has turned to be interesting in fields like, for exaple, software engeneering where it can be used to proved certain modularity properties of the specification of a system [12, 15]. Our approach to the IP is purely semantical. For K a class of models (say of FO) let j= K be the standard semantic consequence relation for K: for Phi [ f g a set of sentences, Phi j= K iff all models of Phi in K are also models of . As usual, for Phi = f g we use j= K , and j= K ....
G. Renardel de Lavalette. Modularisation, parametrisation and interpolation. J. Inf. Process. Cybern. EIK, 25(5/6):283--292, 1989.
Failure of Interpolation in Combined Modal Logics - Marx, Areces (1997) (5 citations) (Correct)
....a model. The property is not only intuitively valid for scientific reasoning, it also has practical (and computational) consequences. In practice it shows up in the incremental design, specification and development of software, and has received quite some attention in that community (cf. e.g. [MS84, Ren89]. Below we will give a more technical reason why interpolation is desirable: it can help in showing that irreflexivity style rules in an unorthodox axiom system are conservative over the orthodox part. In this paper we look at interpolation in combined modal logics (and we will see that first ....
....notion in modal logic (e.g. every modal logic of an elementary class of frames is compact) AIP and TIP are often referred to as the strong and weak interpolation property, respectively. We note that the splitting interpolation version is the one used in connection with modularisation of programs [MS84, Ren89]. In the rest of the article j= refers always to the global consequence relation. Proof. For (i) use the fact that with the local relation the deduction theorem j= loc iff j= holds. We prove (ii) for the uni modal case only. The proof extends easily to any modal similarity type. For ....
Renardel de Lavalette, G. Modularisation, parametrisation and interpolation. J. Inf. Process. Cybern. EIK, 25(5/6):283--292, 1989.
Failure of Interpolation in Combined Modal Logics - Marx, Areces (1999) (5 citations) (Correct)
....only intuitively valid for scientific reasoning, it also has practical (and computational) consequences. In practice it shows up in the incremental design, specification and development of software, and has received quite some attention in that community (cf. Maibaum and Sadler, 16] Renardel, [21]. Below we will give a more technical reason why interpolation is desirable: it can help in showing that irreflexivity style rules in an unorthodox axiom system are conservative over the orthodox part. In this paper we look at interpolation in combined modal logics (and we will see that first ....
....notion in modal logic (e.g. every modal logic of an elementary class of frames is compact) AIP and TIP are often referred to as the strong and weak interpolation property, respectively. We note that the splitting interpolation version is the one used in connection with modularisation of programs [16, 21]. In the rest of the article j= refers always to the global consequence relation. Proof. For (i) use the fact that with the local relation the deduction theorem j= loc iff j= holds. We prove (ii) for the uni modal case only. The proof extends easily to any modal similarity type. ....
Renardel de Lavalette, G. Modularisation, parametrisation and interpolation. J. Inf. Process. Cybern. EIK, 25(5/6):283--292, 1989.
Interpolation in Modal Logic - Maarten Marx Institute (1999) (2 citations) (Correct)
No context found.
Renardel de Lavalette, G. (1989). Modularisation, parametrisation and interpolation. J. Inf. Process. Cybern. EIK, 25(5/6):283-- 292.
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