Английская Википедия:Institution (computer science)
The notion of institution was created by Joseph Goguen and Rod Burstall in the late 1970s, in order to deal with the "population explosion among the logical systems used in computer science". The notion attempts to "formalize the informal" concept of logical system.[1]
The use of institutions makes it possible to develop concepts of specification languages (like structuring of specifications, parameterization, implementation, refinement, and 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), and heterogeneous specification and combination of logics.
The spread of institutional model theory has generalized various notions and results of model theory, and institutions themselves have impacted the progress of universal logic.[2][3]
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 is that there is a satisfaction relation between models and sentences, telling whether a sentence holds in a model or not. Satisfaction is inspired by Tarski's truth definition, but can in fact be any binary relation. A crucial feature of institutions is that models, sentences, and their satisfaction, are always considered to live in some vocabulary or context (called signature) that defines the (non-logic) symbols that may be used in sentences and that need to be interpreted in models. Moreover, signature morphisms allow to extend signatures, change notation, and so on. 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 the 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.
Let <math>\mathbf{Cat}^{\mathrm{op}}</math> denote the opposite of the category of small categories. An institution formally consists of
- a category <math>\mathbf{Sign}</math> of signatures,
- a functor <math>\mathit{Sen} \colon \mathbf{Sign} \to </math> <math>\mathbf{Set}</math> giving, for each signature <math>\Sigma</math>, the set of sentences <math>\mathit{Sen}(\Sigma)</math>, and for each signature morphism <math>\sigma \colon \Sigma \to \Sigma'</math>, the sentence translation map <math>\mathit{Sen}(\sigma) \colon \mathit{Sen}(\Sigma) \to \mathit{Sen}(\Sigma')</math>, where often <math>\mathit{Sen}(\sigma)(\varphi)</math> is written as <math>\sigma(\varphi)</math>,
- a functor <math>\mathbf{Mod} \colon \mathbf{Sign} \to \mathbf{Cat}^{\mathrm{op}}</math> giving, for each signature <math>\Sigma</math>, the category of models <math>\mathbf{Mod}(\Sigma)</math>, and for each signature morphism <math>\sigma \colon \Sigma \to \Sigma'</math>, the reduct functor <math>\mathbf{Mod}(\sigma) \colon \mathbf{Mod}(\Sigma') \to \mathbf{Mod}(\Sigma)</math>, where often <math>\mathbf{Mod}(\sigma)(M')</math> is written as <math>M'|_{\sigma}</math>,
- a satisfaction relation <math>{\models_{\Sigma}} \subseteq|{\mathbf{Mod}(\Sigma)| \times \mathit{Sen}(\Sigma)}</math> for each <math>\Sigma \in \mathbf{Sign}</math>,
such that for each <math>\sigma \colon \Sigma \to \Sigma'</math> in <math>\mathbf{Sign}</math>, the following satisfaction condition holds:
<math display="block">M' \models_{\Sigma'} \sigma(\varphi) \quad\text{if and only if}\quad M'|_{\sigma} \models_{\Sigma} \varphi</math>
for each <math>M' \in \mathbf{Mod}(\Sigma')</math> and <math>\varphi \in \mathit{Sen}(\Sigma)</math>.
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 "category" of all large categories.
Examples of institutions
- Common logic
- Common Algebraic Specification Language (CASL)
- First-order logic
- Higher-order logic
- Intuitionistic logic
- Modal logic
- Propositional logic
- Temporal logic
- Web Ontology Language (OWL)
See also
References
Further reading
- Шаблон:Citation. This was the first publication on institution theory and the preliminary version of Goguen and Burstall (1992).
- Шаблон:Citation
- Шаблон:Citation
- Шаблон:Citation
- Шаблон:Citation
External links
- Шаблон:Citation
- Шаблон:Citation
- Formalism, Logic, Institution - Relating, Translating and Structuring. Includes large bibliography.
- Шаблон:Citation. Contains recent work on institutional model theory.
