Institution (computer science)

From Wikipedia, the free encyclopedia

The notion of institution has been created by Joseph Goguen and Rod Burstall in the late 1970's in order to deal with the "population explosion among the logical systems used in computer science". The notion tries to capture the essence of what a logical system is. With this, it is possible to develop concepts of specification languages (like structuring of specifications, parameterization, implementation, refinement, development), proof calculi and even tools in a way completely independent of the underlying logical system. There are also morphisms that allow to relate and translate logical systems. Important applications of this are re-use of logical structure (also called borrowing), heterogeneous specification and combination of logics. Recently, institutional model theory has generalized many notions and deep results of model theory.

1 Definition
2 Examples of Institutions
3 Papers
4 External links
5 See also

[edit] Definition

The theory of institutions does not assume anything about the nature of the logical system. That is, models and sentences may be arbitrary objects; the only assumption being that there is a satisfaction relation between models and sentences, telling whether a sentence holds in a model or not. A crucial feature of institutions now is that models, sentences and their satisfaction are always being considered to live in some vocabulary or context (called signature) that defines the (non-logical) symbols that may be used in sentences and that need to be interpreted in models. Moreover, signature morphisms allow to extend signatures, change notation etc. Nothing is assumed about signatures and signature morphisms except that signature morphisms can be composed; this amounts to having a category of signatures and morphisms. Finally, it is assumed that signature morphisms lead to translations of sentences and models in a way that satisfaction is preserved. While sentences are translated along with signature morphisms (think of symbols being replaced along the morphism), models are translated (or better: reduced) against signature morphisms: for example, in case of a signature extension, a model of the (larger) target signature may be reduced to a model of the (smaller) source signature by just forgetting some components of the model.

Formally, an institution consists of

a category $S i g n$ of signatures,
a functor $sen:Sign \to$ Set giving, for each signature $Σ$ , the set of sentences $s e n (Σ)$ , and for each signature morphism $\sigma:\Sigma\to\Sigma'$ , the sentence translation map $sen(\sigma):sen(\Sigma)\to sen(\Sigma')$ , where often $sen(\sigma)(\varphi)$ is written as $\sigma(\varphi)$ ,
a functor $Mod:Sign^{op}\to$ Cat giving, for each signature $Σ$ , the category of models $M o d (Σ)$ , and for each signature morphism $\sigma:\Sigma\to\Sigma'$ , the reduct functor $Mod(\sigma):Mod(\Sigma')\to Mod(\Sigma)$ , where often $M o d (σ)(M')$ is written as $M' | σ$ ,
a satisfaction relation ${\models_{\Sigma}}\subseteq|{Mod(\Sigma)|\times sen(\Sigma)}$ for each $\Sigma\in Sign$ ,

such that for each $\sigma:\Sigma\to\Sigma'$ in $S i g n$ the following satisfaction condition holds:

$M'\models_{\Sigma'}\sigma(\varphi)$ if and only if $M'|_{\sigma} \models_{\Sigma} \varphi$

for each $M'\in Mod(\Sigma')$ and $\varphi\in sen(\Sigma)$ .

The satisfaction condition expresses that truth is invariant under change of notation (and also under enlargement or quotienting of context).

Strictly speaking, the model functor ends in the quasi-category of all large categories.

[edit] Examples of Institutions

[edit] Papers

J. A. Goguen and R. M. Burstall, Introducing Institutions, Lecture Notes in Computer Science 164, pp. 221-256, 1984.
J. A. Goguen and R. M. Burstall, Institutions: Abstract Model Theory for Specification and Programming, Journal of the Association for Computing Machinery 39, pp. 95-146, 1992.
J. Meseguer, General Logics, Logic Colloquium 87, pp. 275-329, North Holland, 1989.
J. A. Goguen and G. Rosu, Institution morphisms, Formal aspects of computing 13, pp. 274-307, 2002.
D. Sannella and A. Tarlecki, Specifications in an arbitrary institution, Information and Computation 76, pp. 165-210, 1988
T. Mossakowski, J. A. Goguen, R. Diaconescu, A. Tarlecki. What is a Logic?. In Jean-Yves Beziau (Ed.), Logica Universalis, pp. 113–133. Birkhäuser 2005.