2004
DOI: 10.1016/s0166-218x(02)00304-9
|View full text |Cite
|
Sign up to set email alerts
|

A-classification of idempotent functions of many-valued logic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2006
2006
2008
2008

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…• [15,16] by Marchenkov, which proves that there are finitely many A A -closed clones when 4 ≤ |A| < ω.…”
Section: Introductionmentioning
confidence: 96%
“…• [15,16] by Marchenkov, which proves that there are finitely many A A -closed clones when 4 ≤ |A| < ω.…”
Section: Introductionmentioning
confidence: 96%
“…In a series of papers [1][2][3][4][5][6][7][8][9][12][13][14][15][16][17][18][19][20][21], on the set of functions of many-valued logic closure operators are defined, which are much more strong than the usually considered superposition operator. In particular, for any k 2 these operators generate on the set P k of the functions of k-valued logic finite (occasionally, countable) classifications.…”
Section: Introductionmentioning
confidence: 99%