Effective embeddings for classes of structures via enumeration operators

Abstract: One can effectivize the notion of Borel embedding for classes of structures by considering Turing operators or enumeration operators. In this talk, I will try to argue that it is interesting to study how these two effective notions of Borel embedding relate to each other even if we consider some simple classes of structures such as pairs of linear orderings, closed under isomorphism.

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.