Abstract
Any abstract mathematical structure, for example an abstract algebra or an abstract relational system, is intended to serve as a pattern of a class of “concrete” structures. In the concrete structures their components, for instance the operations or the relations, are defined directly, while in the abstract structures they are defined in terms of a set of conditions treated as axioms. As an example consider Boolean algebras. In the algebras of sets the operations of union, intersection, and complement of sets are defined in the well known way. These are the direct definitions saying how the respective compound sets are made out of the component sets. An abstract Boolean algebra is defined in an axiomatic way. Join, meet, and complement of elements of any algebra from the class are assumed to satisfy some conditions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Demri, S.P., Orłowska, E.S. (2002). Informational Representability. In: Incomplete Information: Structure, Inference, Complexity. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04997-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-04997-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07540-7
Online ISBN: 978-3-662-04997-6
eBook Packages: Springer Book Archive