Ekaterina B. Fokina

According to our database, Ekaterina B. Fokina authored at least 23 papers between 2007 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Degrees of bi-embeddable categoricity.

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Comput., 2021

2020

Learning families of algebraic structures from informant.

Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro

Inf. Comput., 2020

2019

Bi-embeddability spectra and bases of spectra.

Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Math. Log. Q., 2019

Measuring the complexity of reductions between equivalence relations.

Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Comput., 2019

Computability-theoretic categoricity and Scott families.

Ekaterina B. Fokina, Valentina S. Harizanov, Daniel Turetsky

Ann. Pure Appl. Log., 2019

Degrees of bi-embeddable categoricity of equivalence structures.

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Arch. Math. Log., 2019

Limit Learning Equivalence Structures.

Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro

Proceedings of the Algorithmic Learning Theory, 2019

2018

Preface.

Ekaterina B. Fokina

Math. Struct. Comput. Sci., 2018

2016

Categoricity Spectra for Rigid Structures.

Ekaterina B. Fokina, Andrey N. Frolov, Iskander Sh. Kalimullin

Notre Dame J. Formal Log., 2016

Linear Orders Realized by C.E. Equivalence Relations.

Ekaterina B. Fokina, Bakhadyr Khoussainov, Pavel Semukhin, Daniel Turetsky

J. Symb. Log., 2016

2014

Computable model theory.

Ekaterina B. Fokina, Valentina S. Harizanov, Alexander G. Melnikov

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2013

Classes of structures with universe a subset of <i>ω</i>₁.

Ekaterina B. Fokina, Sy-David Friedman, Julia F. Knight, Russell G. Miller

J. Log. Comput., 2013

2012

On Σ¹₁ equivalence relations over the natural numbers.

Ekaterina B. Fokina, Sy-David Friedman

Math. Log. Q., 2012

Isomorphism relations on computable structures.

Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán

J. Symb. Log., 2012

Equivalence Relations That Are Σ⁰₃ Complete for Computable Reducibility - (Extended Abstract).

Ekaterina B. Fokina, Sy-David Friedman, André Nies

Proceedings of the Logic, Language, Information and Computation, 2012

2011

Classes of Ulm type and coding rank-homogeneous trees in other structures.

Ekaterina B. Fokina, Julia F. Knight, Alexander G. Melnikov, Sara Quinn, C. Safranski

J. Symb. Log., 2011

2010

The effective theory of Borel equivalence relations.

Ekaterina B. Fokina, Sy-David Friedman, Asger Törnquist

Ann. Pure Appl. Log., 2010

Degrees of categoricity of computable structures.

Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russell G. Miller

Arch. Math. Log., 2010

2009

Intrinsic bounds on complexity and definability at limit levels.

John Chisholm, Ekaterina B. Fokina, Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Sara Quinn

J. Symb. Log., 2009

Index sets for some classes of structures.

Ekaterina B. Fokina

Ann. Pure Appl. Log., 2009

Equivalence Relations on Classes of Computable Structures.

Ekaterina B. Fokina, Sy-David Friedman

Proceedings of the Mathematical Theory and Computational Practice, 2009

2007

Index sets for classes of high rank structures.

Wesley Calvert, Ekaterina B. Fokina, Sergei S. Goncharov, Julia F. Knight, Oleg V. Kudinov, Andrei S. Morozov, Vadim Puzarenko

J. Symb. Log., 2007

Index Sets of Computable Structures with Decidable Theories.

Ekaterina B. Fokina

Proceedings of the Computation and Logic in the Real World, 2007