Classification of the finite polymorphism-homogeneous tournaments with loops
From International Center for Computational Logic
Classification of the finite polymorphism-homogeneous tournaments with loops
Talk by Thomas Feller
- Location: APB 3027
- Start: 23. August 2018 at 1:00 pm
- End: 23. August 2018 at 2:30 pm
- Research group: Computational Logic
- Research group: Knowledge-Based Systems
- 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ć.
