Classification of the finite polymorphism-homogeneous tournaments with loops
Aus International Center for Computational Logic
Classification of the finite polymorphism-homogeneous tournaments with loops
Vortrag von Thomas Feller
- Veranstaltungsort: APB 3027
- Beginn: 23. August 2018 um 13:00
- Ende: 23. August 2018 um 14:30
- Forschungsgruppe: Computational Logic
- Forschungsgruppe: Wissensbasierte Systeme
- Event series: KBS Seminar
- iCal
The classical notion of "homogeneity" plays a part in model theory. In this talk we look at a variant of this property, the so called "polymorphism-homogeneity", first explicitly examined by Christian and Maja Pech, by classifying the finite tournaments (loops allowed), which are polymorphism-homogeneous. For this we utilize the classification of the finite homomorphism-homogeneous tournaments with loops, done by A. Ilić, D. Mašulović and U. Rajković.
