Abstract
This paper will discuss and characterise the cardinality of boolean (crisp) and fuzzy relations. The main result is a Dedekind inequality for the cardinality, which enables us to manipulate the cardinality of the composites of relations. As applications a few relational proofs for the basic theorems on graph matchings, and fundamentals about network flows will be given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Diestel, R.: Graph theory, Graduate texts in mathematics, 3rd edn., vol. 173. Springer, Berlin (2005)
Freyd, P., Scedrov, A.: Categories, allegories, North-Holland, Amsterdam (1990)
Kawahara, Y., Furusawa, H.: An algebraic formalization of fuzzy relations. Fuzzy Sets and Systems 101, 125–135 (1999)
Schmidt, G., Ströhlein, T.: Relations and graphs – Discrete Mathematics for Computer Science. Springer-Verlag, Berlin (1993)
Tarski, A.: Some metalogical results concerning the calculus of relations. Journal of Symbolic Logic 18(2), 188–189 (1953)
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
Kawahara, Y. (2006). On the Cardinality of Relations. In: Schmidt, R.A. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2006. Lecture Notes in Computer Science, vol 4136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11828563_17
Download citation
DOI: https://doi.org/10.1007/11828563_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37873-0
Online ISBN: 978-3-540-37874-7
eBook Packages: Computer ScienceComputer Science (R0)