Computable isomorphism problem
Valentina Harizanov (George Washington University)
Abstract: These classes include arbitrary structures with at least one relation of arity at least $2$, abelian $p$-groups, linear orders, Boolean algebras, fields of a fixed characteristic, nilpotent semigroups, nilpotent groups, and nilpotent rings. These classes have isomorphic computable structures that are not hyperarithmetically isomorphic. One of the methods we use to establish $\Sigma _{1}^{1}$-completeness of the isomorphism problem for $K$ is based on a uniform effective interpretation of computable structures in a specific class into computable structures in $K$.
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 |