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....

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Vármonostory Endre
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
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:795-805
ISSN:0324-721X