RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
Video Library
Archive
Most viewed videos

Search
RSS
New in collection





You may need the following programs to see the files






Mathematical Logic, Algebra and Computation: A two-day conference dedicated to 85-th anniversary of S. I. Adian
July 18, 2016 12:10–13:00, Moscow, Steklov Mathematical Institute of RAS, Gubkina, 8
 


Decidability, complexity and index sets of classes of computable models

S. S. Goncharov
Video records:
Flash Video 1,570.2 Mb
Flash Video 263.4 Mb
MP4 263.4 Mb
Materials:
Adobe PDF 199.4 Kb

Number of views:
This page:215
Video files:78
Materials:44

S. S. Goncharov
Photo Gallery


Видео не загружается в Ваш браузер:
  1. Установите Adobe Flash Player    

  2. Проверьте с Вашим администратором, что из Вашей сети разрешены исходящие соединения на порт 8080
  3. Сообщите администратору портала о данной ошибке

Abstract: We will discuss the problems about decidability of models with different properties. The first problem is connected with existence of decidable presentations for models. The second class is problems about autostability and another equivalence relations on computable models. We will consider these problems on the base of approach suggested by S. S. Goncharov and J.Knight via computable numberings and index sets of classes numbers in some computable numberings.
We will give the results about complexity of characterization of autostable relative to strong constructivizations computable models in differen classes of models and slgebraic structures. We will consider the connection of complexity definable relations of computable models with computable numberings in general sense relative to classification of index sets [1], [4], [3], [5].

Materials: goncharov.pdf (199.4 Kb)

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020