Partially ordered pattern algebras
A partial order ≤ on a set A induces a partition of each power An into "patterns" in a natural way. An operation on A is called a ≤-pattern operation if its restriction to each pattern is a projection. We examine functional completeness of algebras with ≤-pattern fundamental operations....
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2008
|
| Sorozat: | Acta cybernetica
18 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algebra, Matematika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12848 |
| LEADER | 01076nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12848 | ||
| 005 | 20220616155815.0 | ||
| 008 | 161015s2008 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Vármonostory Endre | |
| 245 | 1 | 0 | |a Partially ordered pattern algebras |h [elektronikus dokumentum] / |c Vármonostory Endre |
| 260 | |c 2008 | ||
| 300 | |a 795-805 | ||
| 490 | 0 | |a Acta cybernetica |v 18 No. 4 | |
| 520 | 3 | |a A partial order ≤ on a set A induces a partition of each power An into "patterns" in a natural way. An operation on A is called a ≤-pattern operation if its restriction to each pattern is a projection. We examine functional completeness of algebras with ≤-pattern fundamental operations. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Matematika | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Algebra, Matematika | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12848/1/Varmonostory_2008_ActaCybernetica.pdf |z Dokumentum-elérés |