The Słupecki criterion by duality (Q2773026)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Słupecki criterion by duality |
scientific article; zbMATH DE number 1709155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Słupecki criterion by duality |
scientific article; zbMATH DE number 1709155 |
Statements
The Słupecki criterion by duality (English)
0 references
24 March 2002
0 references
primal algebra
0 references
Galois connection
0 references
Słupecki criterion
0 references
primality
0 references
functional completeness
0 references
operation-relation duality
0 references
diagonal relations
0 references
The author presents a method for proving primality and functional completeness theorems that makes use of the operation-relation duality. She investigates relations generated by the two-element subsets of \(A^k\) only and shows how the method applies for proving Słupecki's classical theorem by generating diagonal relations from each pair of \(k\)-tuples.
0 references
0.7390750646591187
0 references
0.6932724714279175
0 references
0.6883977055549622
0 references
0.6883314251899719
0 references