The tree of tuples of a structure

Abstract: Given a countable structure, one can associate a tree of finite tuples from that structure, with each tuple labeled by its atomic type. This tree encodes the back-and-forth information of the structure, and hence determines the isomorphism type, but it is still missing something: with Montalban I proved that there are structures which cannot be computably (or even hyperarithmetically) recovered from their tree of tuples. I'll explain the meaning of this result by exploring two separate threads in computable structure theory: universality and coding.

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.