default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEkaterina B. Fokina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Nikolay Bazhenov
, Ekaterina B. Fokina, Dino Rossegger, Alexandra A. Soskova, Stefan V. Vatev:
Learning Families of Algebraic Structures from Text. CiE 2024: 166-178- [c5]Ekaterina B. Fokina, Sebastiaan A. Terwijn:
Computable Structure Theory of Partial Combinatory Algebras. CiE 2024: 265-276 - 2021
- [j18]Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
Degrees of bi-embeddable categoricity. Comput. 10(1): 1-16 (2021) - 2020
- [j17]Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro:
Learning families of algebraic structures from informant. Inf. Comput. 275: 104590 (2020)
2010 – 2019
- 2019
- [j16]Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
Degrees of bi-embeddable categoricity of equivalence structures. Arch. Math. Log. 58(5-6): 543-563 (2019) - [j15]Ekaterina B. Fokina, Valentina S. Harizanov, Daniel Turetsky:
Computability-theoretic categoricity and Scott families. Ann. Pure Appl. Log. 170(6): 699-717 (2019) - [j14]Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
Measuring the complexity of reductions between equivalence relations. Comput. 8(3-4): 265-280 (2019) - [j13]Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
Bi-embeddability spectra and bases of spectra. Math. Log. Q. 65(2): 228-236 (2019) - [c4]Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro:
Limit Learning Equivalence Structures. ALT 2019: 383-403 - 2018
- [j12]Ekaterina B. Fokina:
Preface. Math. Struct. Comput. Sci. 28(3): 338-339 (2018) - 2016
- [j11]Ekaterina B. Fokina, Bakhadyr Khoussainov, Pavel Semukhin, Daniel Turetsky:
Linear Orders Realized by C.E. Equivalence Relations. J. Symb. Log. 81(2): 463-482 (2016) - [j10]Ekaterina B. Fokina, Andrey N. Frolov, Iskander Sh. Kalimullin:
Categoricity Spectra for Rigid Structures. Notre Dame J. Formal Log. 57(1): 45-57 (2016) - 2014
- [p1]Ekaterina B. Fokina, Valentina S. Harizanov, Alexander G. Melnikov:
Computable model theory. Turing's Legacy 2014: 124-194 - 2013
- [j9]Ekaterina B. Fokina, Sy-David Friedman, Julia F. Knight, Russell G. Miller:
Classes of structures with universe a subset of ω1. J. Log. Comput. 23(6): 1249-1265 (2013) - 2012
- [j8]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): 122-132 (2012) - [j7]Ekaterina B. Fokina, Sy-David Friedman:
On Σ11 equivalence relations over the natural numbers. Math. Log. Q. 58(1-2): 113-124 (2012) - [c3]Ekaterina B. Fokina, Sy-David Friedman, André Nies:
Equivalence Relations That Are Σ03 Complete for Computable Reducibility - (Extended Abstract). WoLLIC 2012: 26-33 - 2011
- [j6]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): 846-869 (2011) - 2010
- [j5]Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russell G. Miller:
Degrees of categoricity of computable structures. Arch. Math. Log. 49(1): 51-67 (2010) - [j4]Ekaterina B. Fokina, Sy-David Friedman, Asger Törnquist:
The effective theory of Borel equivalence relations. Ann. Pure Appl. Log. 161(7): 837-850 (2010)
2000 – 2009
- 2009
- [j3]Ekaterina B. Fokina:
Index sets for some classes of structures. Ann. Pure Appl. Log. 157(2-3): 139-147 (2009) - [j2]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): 1047-1060 (2009) - [c2]Ekaterina B. Fokina, Sy-David Friedman:
Equivalence Relations on Classes of Computable Structures. CiE 2009: 198-207 - 2007
- [j1]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): 1418-1432 (2007) - [c1]Ekaterina B. Fokina:
Index Sets of Computable Structures with Decidable Theories. CiE 2007: 290-296
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
