LINEAR INDEPENDENCE IN BOTTLENECK ALGEBRAS

Citation
K. Cechlarova et J. Plavka, LINEAR INDEPENDENCE IN BOTTLENECK ALGEBRAS, Fuzzy sets and systems, 77(3), 1996, pp. 337-348
Citations number
22
Categorie Soggetti
Computer Sciences, Special Topics","System Science",Mathematics,"Statistic & Probability",Mathematics,"Computer Science Theory & Methods
Journal title
ISSN journal
01650114
Volume
77
Issue
3
Year of publication
1996
Pages
337 - 348
Database
ISI
SICI code
0165-0114(1996)77:3<337:LIIBA>2.0.ZU;2-Q
Abstract
Let (R, less than or equal to) be a linearly ordered set. A bottleneck algebra is the set R together with two operations a + b = max {a,b} a nd a x b = min {a,b}. In this paper we suggest various definitions of linear independence of sets of n-tuples over R and study their charact eristics and interrelations.