Coding in the automorphism group of a structure
Dan Turetsky (Victoria University of Wellington, New Zealand)
Abstract: In this talk I will discuss a new technique for coding a closed set into the automorphism group of a structure. This technique has applications to problems in Scott rank, effective dimension, and degrees of categoricity. For instance, I will explain how it can be used to construct a computably categorical structure with noncomputable Scott rank.
logic
Audience: researchers in the topic
Computability theory and applications
Series comments: Description: Computability theory, logic
The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia. While the meetings are always scheduled for Tuesdays, the timezone varies, so please refer to the calendar on the website for details about individual seminars.
Organizers: | Damir Dzhafarov*, Vasco Brattka*, Ekaterina Fokina*, Ludovic Patey*, Takayuki Kihara, Noam Greenberg, Arno Pauly, Linda Brown Westrick |
*contact for this listing |