Loading...
Please wait, while we are loading the content...
Similar Documents
2 Operations and Relations
| Content Provider | Scilit |
|---|---|
| Author | Denecke, Klaus Wismath, Shelly L. |
| Copyright Year | 2018 |
| Description | Clones can then be characterized as Galois-closed sets of operations, that is, sets F having the property that PolInvF = F (see R. Poschel and L. A. Kalu'inin, [96]). Dually, closed sets R of relations satisfying InvPolR = R are called relational clones. There is also an algebraic characterization of relational clones using certain operations defined on sets of relations ([96]). As we saw in Section 6.1, the two classes of closed sets of a Galois-connection form complete lattices which are dually isomorphic to each other. In the specific case of clones of operations, we see that the set of all clones of operations defined on a base set A forms a complete lattice LA; moreover this lattice is dually isomorphic to the lattice of all relational clones on A. Book Name: Universal Algebra and Applications in Theoretical Computer Science |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2006-0-13519-4&isbn=9781315273686&doi=10.1201/9781315273686-29&format=pdf |
| Ending Page | 262 |
| Page Count | 34 |
| Starting Page | 229 |
| DOI | 10.1201/9781315273686-29 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2018-10-03 |
| Access Restriction | Open |
| Subject Keyword | Book Name: Universal Algebra and Applications in Theoretical Computer Science Logic Galois Algebraic Satisfying Dually Relational Clones Poschel Polinvf Kalu'inin Invpolr |
| Content Type | Text |
| Resource Type | Chapter |
