Abstract
Let ≤ be a fixed order of height at least 2 on a set A (i.e., contains a chain a < b < c). It is shown that all the isotone clones preserving orders on A isomorphic to ≤ intersect in the clone KA of trivial functions (i.e., all the projections and all the constant operations on A). It is further shown that for A finite with at least eight elements and for any six-element set there exist two orders on A such that every joint endomorphism is trivial (i.e., idA or constants). The same is true for intersections of isotone clones. This yields that with the above restrictions there are four maximal isotone clones intersecting in KA. Separate considerations are given on the intersections of maximal isotone clones for |A| = 3 and 4.
| Original language | English |
|---|---|
| Pages (from-to) | 248-253 |
| Number of pages | 6 |
| Journal | Proceedings of The International Symposium on Multiple-Valued Logic |
| State | Published - 1990 |
| Event | Proceedings of the 20th International Symposium on Multiple-Valued Logic - Charlotte, NC, USA Duration: May 23 1990 → May 25 1990 |
ASJC Scopus Subject Areas
- General Computer Science
- General Mathematics
Fingerprint
Dive into the research topics of 'Intersections of isotone clones on a finite set'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS