Research

FWF Project P 36781: "Classifying structures by learning"
(Principal Investigator, 2024 – Ongoing)

FWF Project P 27527: "Equivalence relations in computable model theory"
(Principal Investigator, 2014 – 2018)
FWF Project V 206: "Automatic structures among computable structures"
(Elise Richter Fellow / Principal Investigator, 2012 – 2016)
FWF Project P 23989: "Algorithmic randomness and computable model theory"
(Project Leader, 2011 – 2014)
FWF Project M 1188: "Algorithmic properties of structures and theories"
(Lise Meitner Fellow, 2010 – 2012)

2025 E. Fokina and S. Lempp. Syntactic characterization of learnability of structures with mind changes. In: Information and Computation (2025).
2024 E. Fokina and S. Terwijn. Computable structure theory of partial combinatory algebras⋆. In: Lecture Notes in Computer Science, (2024)Patey, L.L. (ed.), Twenty Years of Theoretical and Practical Synergies: 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024, Proceedings, pp. 265-276.
2014 E. Fokina, V. Harizanov, and A. Melnikov. Computable model theory. In: Turing's Legacy: Developments from Turing's Ideas in Logic, Ed. R. Downey, Cambridge University Press, Lecture Notes in Logic 42 (2014), 124-194.
2010 E. Fokina, I. Kalimullin, and R. Miller. Degrees of computability of structures. In: Computability in Context: Computation and Logic in the Real World, Imperial College Press 2011, 93-133.