Abstract
The notion of information system can be seen as a semantic system, but essentially algebraical in the nature. We show in this note, that it can be treated as a many sorted algebra and that the algebra of terms can be useful in describing and analysing the data in the system.
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.
References
Mainke, T.: Universal algebra. In: Abramsky, S., Gabbay, D.M., Meibaum, T.S. (eds.) Handbook of logic in Computer Science, New York
Pomykała, J.A.: Similarity in relational databases and in information systems theory. Demonstratio Math. XXXV(4) (2002)
Pomykała, J.A.: On the notion of homomorphism in many sorted algebras. Demonstratio Math. XXXVI(3) (2003)
Wiweger, A.: On topological rough sets. Bull. Pol. Ac. Sc. Math. 37(1-6) (1989)
Wiweger, A.: Knowledge Representation Systems, Logical kits and Contexts. Bull. Pol. Ac. Sc. Math. 36(3-4) (1988)
Semadeni, Z.: On classification, logical educational materials and automata. Colloq. Math. 31, 137–153 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pomykała, J.A. (2006). Algebras of Terms in Pawlak’s Information Systems. In: Greco, S., et al. Rough Sets and Current Trends in Computing. RSCTC 2006. Lecture Notes in Computer Science(), vol 4259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908029_8
Download citation
DOI: https://doi.org/10.1007/11908029_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47693-1
Online ISBN: 978-3-540-49842-1
eBook Packages: Computer ScienceComputer Science (R0)