Summary. Concepts have been expressed mathematically as propositions in a distributive lattice. A more comprehensive formulation is that of a generalized lattice, or category, in which the concepts are related in hierarchical fashion by lattice-like links called concept morphisms. A concept morphism describes how an abstract concept can be used within a more specialized concept in more than one way as with “color”, which can appear in “apples” as either “red”, “yellow” or “green”. Further, “color” appears in “apples” because it appears in “red”, “yellow” or “green”, which in turn appear in “apples”, expressed via the composition of concept morphisms. The representation of such concept relationships in multi-regional neural networks can be expressed in category theory through the use of categories, commutative diagrams, functors, and natural trasformations. Additionally, categorical model theory expresses the possible worlds described by concepts. The analysis of morphisms between the possible worlds highlights the importance of reciprocal connections in neural networks.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Healy, M.J., Caudell, T.P. (2007). Generalized Lattices Express Parallel Distributed Concept Learning. In: Kaburlasos, V.G., Ritter, G.X. (eds) Computational Intelligence Based on Lattice Theory. Studies in Computational Intelligence, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72687-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-72687-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72686-9
Online ISBN: 978-3-540-72687-6
eBook Packages: EngineeringEngineering (R0)