Seminars
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Calendar
Search
Add a seminar

RSS
Forthcoming seminars




Seminars "Proof Theory" and "Logic Online Seminar"
April 11, 2023 18:30, Moscow, Zoom
 


The degrees of relative computable categoricity

I. Sh. Kalimullin

Kazan (Volga Region) Federal University
Video records:
MP4 183.8 Mb

Number of views:
This page:219
Video files:39



Abstract: For a Turing degree $\mathbf x$ a computable algebraic structure $\mathcal A$ is relatively $\mathbf x$-computable categorical if there is an $\mathbf x$-computable family of existential formulas defining the automorphism orbits of tuples from $\mathcal A$. We will study the collection of Turing degrees $\mathbf x$ for which a particular computable structure is relatively $\mathbf x$-computable categorical. This consideration also will give a series of unexpected results in the classical recursion theory context.

Language: English
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024