default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohanna N. Y. Franklin
Person information
- affiliation: Hofstra University, Hempstead, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Wesley Calvert
, Johanna N. Y. Franklin, Dan Turetsky:
Structural Highness Notions. J. Symb. Log. 88(4): 1692-1724 (2023)- 2022
- [e1]Ulrich Berger, Johanna N. Y. Franklin, Florin Manea, Arno Pauly:
Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings. Lecture Notes in Computer Science 13359, Springer 2022, ISBN 978-3-031-08739-4 [contents] - 2021
- [c5]Johanna N. Y. Franklin:
A Church-Turing Thesis for Randomness? CiE 2021: 217-226 - 2020
- [j18]Johanna N. Y. Franklin, Timothy H. McNicholl:
Degrees of and lowness for isometric isomorphism. J. Log. Anal. 12 (2020) - [j17]Johanna N. Y. Franklin, Reed Solomon:
Lowness for isomorphism, countable ideals, and computable traceability. Math. Log. Q. 66(1): 104-114 (2020)
2010 – 2019
- 2019
- [j16]Johanna N. Y. Franklin, Dan Turetsky:
Taking the path computably traveled. J. Log. Comput. 29(6): 969-973 (2019) - [j15]Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute:
Algorithmic Randomness and Fourier Analysis. Theory Comput. Syst. 63(3): 567-586 (2019) - 2018
- [j14]Johanna N. Y. Franklin, Dan Turetsky:
Lowness for isomorphism and degrees of genericity. Comput. 7(1): 1-6 (2018) - 2017
- [c4]Johanna N. Y. Franklin:
Strength and Weakness in Computable Structure Theory. Computability and Complexity 2017: 302-323 - 2015
- [j13]Wesley Calvert, Johanna N. Y. Franklin:
Genericity and UD-random reals. J. Log. Anal. 7 (2015) - 2014
- [j12]Johanna N. Y. Franklin, Reed Solomon:
Degrees that Are Low for Isomorphism. Comput. 3(2): 73-89 (2014) - [j11]Johanna N. Y. Franklin, Keng Meng Ng:
ω-Change Randomness and Weak Demuth Randomness. J. Symb. Log. 79(3): 776-791 (2014) - [j10]David Diamondstone, Johanna N. Y. Franklin:
Lowness for Difference Tests. Notre Dame J. Formal Log. 55(1): 63-73 (2014) - 2013
- [j9]Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan, Guohua Wu:
Anti-complex sets and reducibilities with tiny use. J. Symb. Log. 78(4): 1307-1327 (2013) - [j8]Barbara F. Csima, Johanna N. Y. Franklin, Richard A. Shore:
Degrees of Categoricity and the Hyperarithmetic Hierarchy. Notre Dame J. Formal Log. 54(2): 215-231 (2013) - [c3]Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon:
Local Computability for Ordinals. CiE 2013: 161-170 - 2011
- [j7]Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu:
A superhigh diamond in the c.e. tt-degrees. Arch. Math. Log. 50(1-2): 33-44 (2011) - [j6]Johanna N. Y. Franklin, Frank Stephan:
Van Lambalgen's Theorem and High Degrees. Notre Dame J. Formal Log. 52(2): 173-185 (2011) - 2010
- [j5]Johanna N. Y. Franklin:
Schnorr triviality and genericity. J. Symb. Log. 75(1): 191-207 (2010) - [j4]Johanna N. Y. Franklin, Frank Stephan:
Schnorr trivial sets and truth-table reducibility. J. Symb. Log. 75(2): 501-521 (2010) - [j3]Johanna N. Y. Franklin:
Subclasses of the Weakly Random Reals. Notre Dame J. Formal Log. 51(4): 417-426 (2010)
2000 – 2009
- 2009
- [c2]Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu:
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms. TAMC 2009: 420-429 - 2008
- [j2]Johanna N. Y. Franklin:
Schnorr trivial reals: a construction. Arch. Math. Log. 46(7-8): 665-678 (2008) - [j1]Johanna N. Y. Franklin:
Hyperimmune-free degrees and Schnorr triviality. J. Symb. Log. 73(3): 999-1008 (2008) - 2006
- [c1]Johanna N. Y. Franklin:
Schnorr Trivial Reals: A construction. CCA 2006: 79-93
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-04-24 22:53 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:
