Article
The mathematical concept of morphism tries to produce an image of a set that captures its structure. The notion of infomorphism generalizes and extends this idea by means of defining certain homomorphism among structures supporting infons. The concept emerged originally in situation semantics and it has been applied in distinct contexts.
Any set A includes all elements or tokens defining a family R of relations on A. Let us call relational structure Consider now the specific relational structure which we may call classificatory relational structure Let An infomorphism i relating f Schematically: As an homomorphism preserves structure, so an infomorphism preserves the instantiation relation, among sets that can be quite distinct, but informationally analogous.
In the references (Devlin, Gunji) you may find relevant examples of infomorphisms.
References
- BARWISE, J. & SELIGMAN, J. (1997).
*Information Flow. The Logic of Distributed Systems*. Cambridge: C.U.P. - BREMER, M. & COHNITZ, D. (2004).
*Information and Information Flow*. Frankfurt: Ontos Verlag. - DEVLIN, K. (2001).
*The Mathematics of Information. Lecture 4: Introduction to Channel Theory*. ESSLLI 2001, Helsinki, Finland - GUNJI, Y.P., TAKAHASHI, T. & AONO, M. (2004) "Dynamical infomorphism: form of endo-perspective".
*Chaos, Solitrons & Fractals*22, 1077-1101.
| Entries
New entry. Before doing a new entry, please, copy this line and the following ones and paste them at the column bottom. Next fill out the fields: 'name', 'date' and 'text', and delete this upper blue paragraph.Name (date)[Entry text] Incorporated entriesFrancisco Salto (29-07-2009)[First version of the entry "infomorphism" is available] |