Effective properties of abstract structures
Participants
Bulgarian participants
 Hristo Ganchev, Sofia University
 Ivan Georgiev, Sofia University
 Alexandra Soskova, Sofia University
 Mariya Soskova, University of Wisconsin–Madison
 Stefan Vatev, Sofia University
Foreign participants
 Ekaterina Fokina, Vienna University of Technology
 Luca San Mauro, Sapienza University of Rome
 Dino Rosseger, Vienna University of Technology and University of California, Berkeley
Published papers

R. Alvir, W. Calvert, G. Goodman, V. Harizanov, J. Knight, A. Morozov, R. Miller, A. Soskova, R. Weisshaar, Interpreting a field in its Heisenberg group, Journal of Symbolic Logic, 2021, (doi)

Alexandra Soskova, Effective embedding and interpretations, Dagstuhl Reports, Volume 11, Issue 10, November 2021 “Descriptive Set Theory and Computable Topology” (21461), Mathieu Hoyrup, Arno Pauly, Victor Selivanov, and Mariya I. Soskova eds. 2021 (doi)

Ivan Georgiev, Uniform Limits of Conditionally Computable Real Functions. In: Higherorder Complexity Theory and its Applications, Eds. Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg. NII Shonan Meeting Report, No. 15, National Institute of Informatics, ChiyodaKu, Tokyo, Japan, 2019

R. Dimitrov, V. Harizanov, A. Morozov, P. Shafer, A. Soskova, S. Vatev, On cohesive powers of linear orders, Journal of Symbolic Logic, 2023, vol. 88 (3), pp. 947  1004 (doi)

Ivan Georgiev, Interplay between patterns of zeros and the complexity of Dedekind cuts, Computability, 2024, vol. 13 (2), pp. 135  159 (doi)
Talks at conferences and seminars

Ivan Georgiev, Uniform Limits of Conditionally Computable Real Function. Seminar No, 15, Higherorder Complexity Theory and its Applications, Shonan Village Center, National Institute of Informatics, Tokyo, Japan, October 7  10, 2019.

Alexandra Soskova, Effective coding and decoding in graphs and linear orderings, National Coding Theory Workshop, Dedicated to Professor Stefan Dodunekov, Chiflik village, Bulgaria, November 2124, 2019.

Stefan Vatev, Computable embeddings for pairs of structures. The First Workshop on Digitalization and Computable Models. Novosibirsk, Russia, December 1620, 2019.

Alexandra A. Soskova, Coding and decoding in classes of structures, UW Logic Seminar 2020, Madison, Wisconsin, USA, February 4, 2020.

Stefan Vatev, Computable embeddings for ordinals and their reverses, Computability in Europe 2020, 29 June  2 July 2020, (online).

Alexandra Soskova, Effective embeddings and interpretations, Computable Theory and Applications Seminar, 20 October 2020 (online).

Alexandra Soskova, Effective coding and decoding in classes of structures, 3rd World Logic Day, Seminar of Algebra and Logic, BAS, joint meeting with the Seminar of the Department of Mathematical Logic and its Applications of FMI, SU and the Seminar of Logic at the Institute of Philosophy and Sociology of BAS, 15 February 2021(online).

Alexandra Soskova, Cohesive Powers of Linear Orders, Spring Scientific Conference, FMI, SU, 27 March 2021 (in Bulgarian, online).

Stefan Vatev, Effective embeddings for pairs of structures, Spring Scientific Conference, FMI, SU, 27 March, 2021 (in Bulgarian, online).

Alexandra Soskova, Effective coding and decoding in classes of structures, Malt’sev meeting 2021, Novosibirsk. Celebrating the 70th anniversary of Sergey Goncharov, September 2024, 2021 (online).

Alexandra Soskova, Effective embedding and interpretations, Dagstuhl Seminar 2021 “Descriptive Set Theory and Computable Topology” (21461), Germany, November 1419, 2021.

Ivan Georgiev, On the computational complexity of some representations of irrational numbers, 4th World Logic Day, Seminar of Algebra and Logic, BAS, joint meeting with the Seminar of the Department of Mat hematical Logic and its Applications of FMI, SU and the Seminar of Logic at the Institute of Philosophy and Sociology of BAS, 14 January 2021 (online).

Alexandra Soskova, Cohesive Powers of Linear Orders, UW Logic Seminar, Madison Wisconsin, USA, 14 February, 2022.

Stefan Vatev, Effective embeddings for classes of structures via enumeration operators, Computability Theory and Applications Seminar, Technical university, Vienna, 27 April, 2022.

Ivan Georgiev, Comparing the complexity of irrational number representations, Mal’tsev Meeting, Novosibirsk, November 1418, 2022.