Accepted Contributed Talks 

• Svetlana Aleksandrova. On some properties of Σ-definability in hereditarily finite superstructures on reals.

• Aknur Askarbekkyzy, Birzhan Kalmurzayev, and Nikolay Bazhenov. Computable self-full linear orders.

• Ainur Basheyeva and Svetlana Lutsak. On bases of finite pointed abelian groups.

• Nikolay Bazhenov, Birzhan Kalmurzayev, and Alibek Iskakov. Primitive recursive reducibility on c.e. preorder relations.

• Nikolay Bazhenov, Manat Mustafa, and Zhansaya Tleuliyeva. Theories of Rogers semilattices of analytical numberings.

• Andrey Frolov. The spectral universality of the two classes of structures.

• Farkhod Ibragimov, Mars Yamaleev, and Maxim Zubkov. Group representations over locally negative equivalences.

• Botagoz Jankiyeva, Uldana Ostemirova, Artem Slobozhanin, Ramil Bagaviev, and Polina Koneva. Multiple m-reducibility in the Ershov hierarchy.

• Dariusz Kalociński. Degree spectra on (ω,<) and recovering the successor.

• Nurlan Markhabatov. On approximations of structure with finitely many equivalence relations.

• Sam Sanders. Exploring the abyss in Kleene computability theory.

• Artem Slobozhanin. Rogers semilattices of low complexity classes.

• Alexey Stukachev. Computable models of Montague intensional logic.

• Jamalbek Tussupov, Yerzhan Baisalov, and Nurlan Markhabatov. On categoricity of structure with finitely many equivalence relations.

• Stefan Vatev. Learning families of structures.