The Birkhoff completion of finite lattices
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916235048910848 |
|---|---|
| author | Abdulla, Mohammad Hirth, Johannes Stumme, Gerd |
| author_facet | Abdulla, Mohammad Hirth, Johannes Stumme, Gerd |
| contents | We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_02342 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Birkhoff completion of finite lattices Abdulla, Mohammad Hirth, Johannes Stumme, Gerd Discrete Mathematics Artificial Intelligence Logic in Computer Science We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science. |
| title | The Birkhoff completion of finite lattices |
| topic | Discrete Mathematics Artificial Intelligence Logic in Computer Science |
| url | https://arxiv.org/abs/2405.02342 |