default search action
Daniel Turetsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Adam R. Day, Noam Greenberg
, Matthew Harrison-Trainor, Dan Turetsky:
Iterated Priority Arguments in Descriptive Set Theory. Bull. Symb. Log. 30(2): 199-226 (2024) - [j30]Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky:
Enumerations of families closed under finite differences. Comput. 13(1): 89-104 (2024) - 2023
- [j29]Wesley Calvert
Structural Highness Notions. J. Symb. Log. 88(4): 1692-1724 (2023) - [i1]Wesley Calvert, Emma Grunner, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano:
Normality, Relativization, and Randomness. CoRR abs/2312.10204 (2023) - 2022
- [j28]Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky:
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87(1): 47-71 (2022) - 2021
- [j27]Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov
Non-density in punctual computability. Ann. Pure Appl. Log. 172(9): 102985 (2021) - [j26]Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky:
Scott Complexity of Countable Structures. J. Symb. Log. 86(4): 1706-1720 (2021) - 2020
- [j25]Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112: 1-12 (2020) - [j24]Dan Turetsky:
Coding in the automorphism group of a computably categorical structure. J. Math. Log. 20(3): 2050016:1-2050016:24 (2020) - [j23]Rod Downey, Noam Greenberg, Alexander G. Melnikov
Punctual Categoricity and Universality. J. Symb. Log. 85(4): 1427-1466 (2020)
2010 – 2019
- 2019
- [j22]Ekaterina B. Fokina
Computability-theoretic categoricity and Scott families. Ann. Pure Appl. Log. 170(6): 699-717 (2019) - [j21]Noam Greenberg, Rutger Kuyper, Dan Turetsky:
Cardinal invariants, non-lowness classes, and Weihrauch reducibility. Comput. 8(3-4): 305-346 (2019) - [j20]Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky:
Effective aspects of algorithmically random structures. Comput. 8(3-4): 359-375 (2019) - [j19]Johanna N. Y. Franklin, Dan Turetsky:
Taking the path computably traveled. J. Log. Comput. 29(6): 969-973 (2019) - 2018
- [j18]Noam Greenberg, Dan Turetsky:
Strong jump-Traceability. Bull. Symb. Log. 24(2): 147-164 (2018) - [j17]Johanna N. Y. Franklin, Dan Turetsky:
Lowness for isomorphism and degrees of genericity. Comput. 7(1): 1-6 (2018) - [j16]Noam Greenberg, Alexander G. Melnikov
Uniform Procedures in uncountable Structures. J. Symb. Log. 83(2): 529-550 (2018) - [j15]Noam Greenberg, Joseph S. Miller
Two More Characterizations of K-Triviality. Notre Dame J. Formal Log. 59(2): 189-195 (2018) - 2016
- [j14]Ekaterina B. Fokina
Linear Orders Realized by C.E. Equivalence Relations. J. Symb. Log. 81(2): 463-482 (2016) - 2015
- [j13]C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky:
Partial functions and domination. Log. Methods Comput. Sci. 11(3) (2015) - [j12]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky:
Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. 80(1): 116-144 (2015) - [j11]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky:
Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. 80(1): 145-178 (2015) - 2014
- [j10]Laurent Bienvenu, Adam R. Day
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20(1): 80-90 (2014) - [j9]Steffen Lempp, Joseph S. Miller
Lowness for effective Hausdorff dimension. J. Math. Log. 14(2): 1450011 (2014) - [j8]Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79(2): 526-560 (2014) - 2013
- [j7]David Diamondstone, Noam Greenberg, Daniel Turetsky:
Natural Large Degree Spectra. Comput. 2(1): 1-8 (2013) - [j6]Laurent Bienvenu, Noam Greenberg, Antonín Kucera
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23(6): 1183-1194 (2013) - [j5]Chris J. Conidis, Noam Greenberg, Daniel Turetsky:
Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle. Notre Dame J. Formal Log. 54(2): 233-252 (2013) - 2012
- [j4]Daniel Turetsky:
A K-trivial set which is not jump traceable at certain orders. Inf. Process. Lett. 112(13): 544-547 (2012) - 2011
- [j3]Daniel Turetsky:
Connectedness properties of dimension level sets. Theor. Comput. Sci. 412(29): 3598-3603 (2011) - 2010
- [j2]Asher M. Kach, Daniel Turetsky:
Limitwise monotonic functions, sets, and degrees on computable domains. J. Symb. Log. 75(1): 131-154 (2010) - [j1]Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51(1): 85-96 (2010)
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-12-10 20:47 CET 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: