Representation of algebraic convex geometries
| dc.contributor.author | Adaricheva, K. | |
| dc.date.accessioned | 2015-10-29T06:07:28Z | |
| dc.date.available | 2015-10-29T06:07:28Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | Convex geometry is a set system generated by the closure operator with the antiexchange axiom. These systems model the concept of convexity in various settings. They are also closely connected to anti-matroids, which are set systems with the property of accessibility. In particular, the latter were used in modelling the states of human learners and found practical applications in designing the automatic tutoring systems. In current work we develop the theoretical foundations of infinite convex geometries in case their closure operator satisfies the finitary property: closure of any subset is a union of closures of its finite subsets. In such case, the convex geometry is called algebraic. | ru_RU |
| dc.identifier.isbn | 9786018046728 | |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/572 | |
| dc.language.iso | en | ru_RU |
| dc.publisher | Nazarbayev University | ru_RU |
| dc.subject | convex geometries | ru_RU |
| dc.subject | system | ru_RU |
| dc.subject | modelling | ru_RU |
| dc.subject | automatic | ru_RU |
| dc.subject | algebraic | ru_RU |
| dc.title | Representation of algebraic convex geometries | ru_RU |
| dc.type | Abstract | ru_RU |