Describing structures and classes of structures

Julia Knight (University of Notre Dame)

05-Apr-2021, 20:30-21:30 (3 years ago)

Abstract: The talk will recall some definitions and results on Scott complexity of individual countable structures, Borel complexity of classes of structures, and Borel cardinality, for comparing classification problems for different classes. I will try to indicate how methods from computability may sometimes be used in this connection, even for results that do not mention computability. I will state some results on torsion-free Abelian groups, due to Downey-Montalbán, Hjorth, Thomas, and Paolini-Shelah. Finally, I will mention a project with Turbo Ho and Russell Miller, saying what we would like to do, but have not done.

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

Export talk to