On generation of aggregation functions on infinite lattices

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F19%3A73597547" target="_blank" >RIV/61989592:15310/19:73597547 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007%2Fs00500-018-3375-7" target="_blank" >https://link.springer.com/article/10.1007%2Fs00500-018-3375-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00500-018-3375-7" target="_blank" >10.1007/s00500-018-3375-7</a>

Result language
angličtina
Original language name
On generation of aggregation functions on infinite lattices
Original language description
Supremum-dense subsets of aggregation functions, which are defined on infinite complete lattices are described. Also some restriction on the size of a generating set with respect to number of arguments involved in a generating process is discussed.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA18-06915S" target="_blank" >GA18-06915S: New approaches to aggregation operators in analysis and processing of data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)