Ekaterina B. Fokina

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 12

Top Topics

Algebraic Structures

Spectral Images

Top Venues

Math. Struct. Comput. Sci.

Publications

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Alexandra A. Soskova, Stefan V. Vatev
Learning Families of Algebraic Structures from Text. CiE (2024)
Ekaterina B. Fokina, Sebastiaan A. Terwijn
Computable Structure Theory of Partial Combinatory Algebras. CiE (2024)
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Degrees of bi-embeddable categoricity. Comput. 10 (1) (2021)
Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro
Learning families of algebraic structures from informant. Inf. Comput. 275 (2020)
Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro
Limit Learning Equivalence Structures. ALT (2019)
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Degrees of bi-embeddable categoricity of equivalence structures. Arch. Math. Log. 58 (5-6) (2019)
Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Bi-embeddability spectra and bases of spectra. Math. Log. Q. 65 (2) (2019)
Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Measuring the complexity of reductions between equivalence relations. Comput. 8 (3-4) (2019)
Ekaterina B. Fokina, Valentina S. Harizanov, Daniel Turetsky
Computability-theoretic categoricity and Scott families. Ann. Pure Appl. Log. 170 (6) (2019)
Ekaterina B. Fokina
Preface. Math. Struct. Comput. Sci. 28 (3) (2018)
Ekaterina B. Fokina, Andrey N. Frolov, Iskander Sh. Kalimullin
Categoricity Spectra for Rigid Structures. Notre Dame J. Formal Log. 57 (1) (2016)
Ekaterina B. Fokina, Bakhadyr Khoussainov, Pavel Semukhin, Daniel Turetsky
Linear Orders Realized by C.E. Equivalence Relations. J. Symb. Log. 81 (2) (2016)
Ekaterina B. Fokina, Sy-David Friedman, Julia F. Knight, Russell G. Miller
. J. Log. Comput. 23 (6) (2013)
Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán
Isomorphism relations on computable structures. J. Symb. Log. 77 (1) (2012)
Ekaterina B. Fokina, Sy-David Friedman
equivalence relations over the natural numbers. Math. Log. Q. 58 (1-2) (2012)
Ekaterina B. Fokina, Sy-David Friedman, André Nies
Complete for Computable Reducibility - (Extended Abstract). WoLLIC (2012)
Ekaterina B. Fokina, Julia F. Knight, Alexander G. Melnikov, Sara Quinn, C. Safranski
Classes of Ulm type and coding rank-homogeneous trees in other structures. J. Symb. Log. 76 (3) (2011)
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russell G. Miller
Degrees of categoricity of computable structures. Arch. Math. Log. 49 (1) (2010)
Ekaterina B. Fokina, Sy-David Friedman, Asger Törnquist
The effective theory of Borel equivalence relations. Ann. Pure Appl. Log. 161 (7) (2010)
Ekaterina B. Fokina, Sy-David Friedman
Equivalence Relations on Classes of Computable Structures. CiE (2009)
Ekaterina B. Fokina
Index sets for some classes of structures. Ann. Pure Appl. Log. 157 (2-3) (2009)
John Chisholm, Ekaterina B. Fokina, Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Sara Quinn
Intrinsic bounds on complexity and definability at limit levels. J. Symb. Log. 74 (3) (2009)
Ekaterina B. Fokina
Index Sets of Computable Structures with Decidable Theories. CiE (2007)
Wesley Calvert, Ekaterina B. Fokina, Sergei S. Goncharov, Julia F. Knight, Oleg V. Kudinov, Andrei S. Morozov, Vadim Puzarenko
Index sets for classes of high rank structures. J. Symb. Log. 72 (4) (2007)