Non-arithmetic algebraic constructions

Abstract: We examine two radical constructions, one from ring theory and another from module theory, and produce a computable ring for each construction where the corresponding radical is $\Pi^1_1$-complete.

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.