Institution (computer science) - Alchetron, the free social encyclopedia

The notion of institution has been 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 tries to capture the essence of the concept of "logical system".

The use of institutions makes it 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.

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.

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 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 s e n : S i g n → Set giving, for each signature Σ , the set of sentences s e n ( Σ ) , and for each signature morphism σ : Σ → Σ ′ , the sentence translation map s e n ( σ ) : s e n ( Σ ) → s e n ( Σ ′ ) , where often s e n ( σ ) ( φ ) is written as σ ( φ ) ,

a functor M o d : S i g n o p → Cat giving, for each signature Σ , the category of models M o d ( Σ ) , and for each signature morphism σ : Σ → Σ ′ , the reduct functor M o d ( σ ) : M o d ( Σ ′ ) → M o d ( Σ ) , where often M o d ( σ ) ( M ′ ) is written as M ′ | σ ,

a satisfaction relation ⊨ Σ ⊆ | M o d ( Σ ) | × s e n ( Σ ) for each Σ ∈ S i g n ,

such that for each σ : Σ → Σ ′ in S i g n the following satisfaction condition holds:

M ′ ⊨ Σ ′ σ ( φ ) if and only if M ′ | σ ⊨ Σ φ

for each M ′ ∈ M o d ( Σ ′ ) and φ ∈ s e n ( Σ ) .

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

Propositional logic

First-order logic

Higher-order logic

Intuitionistic logic

Modal logic

Temporal logic

Web Ontology Language (OWL)

Common logic

Common Algebraic Specification Language (CASL)

References

Institution (computer science) Wikipedia

(Text) CC BY-SA

Contents

Definition

Examples of institutions

References