Akce ČVUT
| Dnes | ||||||
|---|---|---|---|---|---|---|
| « | duben 2010 | » | ||||
| Po | Út | St | Čt | Pá | So | Ne |
| 1 | 2 | 3 | 4 | |||
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 26 | 27 | 28 | 29 | 30 | ||
Matematická kolokvia: Universal algebra over nominal sets
26.04.2010 11:15
Daniela Petrisan (University of Leicester): Universal algebra over nominal sets
In theoretical computer science nominal sets are regarded as a powerful mathematical model for formal languages involving binding constructors. A nominal set is just a set equipped with in action of a group of permutations on a countable set of names, satisfying some additional properties of `finite supportedness'. I will discuss several characterisation of the category of nominal sets and I will present some results concerning universal algebra in this setting, such as an HSP-like theorem characterising equationally definable classes of algebras over nominal sets. (This is based on joint work with Alexander Kurz and Jiri Velebil.)
- Místo konání
- Zikova 4, Praha 6, 2. poschodí, místnost č. 30 (Z4:B2-351)
- Kontaktní osoba
- RNDr. Veronika Sobotíková, CSc., katedra matematiky FEL, sobotik@fel.cvut.cz
- Podrobnější informace
- http://math.feld.cvut.cz/0rese/kolokvia/kolokvia.htm