Name
Abstract | ||
|---|---|---|
In this paper we give a syntactical answer to the following question: What do we actually know about a partial algebra when we know its set of weak or relative subalgebras with cardinal smaller than a fixed bound, if we do not have any information on how they are linked to each other within the algebra? |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/3-540-69115-4_56 | Rough Sets and Current Trends in Computing |
Keywords | DocType | ISBN |
relative subalgebras,syntactical content,partial algebras,syntactical answer,following question,finite approximations,partial algebra | Conference | 3-540-64655-8 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wiktor Bartol | 1 | 0 | 0.68 |
| Xavier Caicedo | 2 | 81 | 10.11 |
| Francesc Rosselló | 3 | 244 | 29.09 |