Daniel Turetsky

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Normality, Relativization, and Randomness2023-12-15Paper
Limit Complexities, Minimal Descriptions, and $n$-Randomness2022-08-05Paper
Completeness of the hyperarithmetic isomorphism equivalence relation
Advances in Mathematics
2022-05-31Paper
PUNCTUAL CATEGORICITY AND UNIVERSALITY
Journal of Symbolic Logic
2021-04-15Paper
Computable classifications of continuous, transducer, and regular functions2020-10-19Paper
Realizing Computably Enumerable Degrees in Separating Classes2020-08-23Paper
Graphs are not universal for online computability
Journal of Computer and System Sciences
2020-06-09Paper
Effective aspects of algorithmically random structures
Computability
2020-01-17Paper
Degree spectra of structures relative to equivalences
Algebra and Logic
2019-12-06Paper
Computability-theoretic categoricity and Scott families
Annals of Pure and Applied Logic
2019-04-30Paper
Effectively closed subgroups of the infinite symmetric group
Proceedings of the American Mathematical Society
2018-10-23Paper
Uniform procedures in uncountable structures
Journal of Symbolic Logic
2018-08-10Paper
Two more characterizations of \(K\)-triviality
Notre Dame Journal of Formal Logic
2018-05-18Paper
Martin-L\"of reducibility and cost functions2017-07-02Paper
Linear orders realized by c.e. equivalence relations
Journal of Symbolic Logic
2016-08-19Paper
Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
Algebra and Logic
2016-01-13Paper
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
Journal of Symbolic Logic
2015-05-20Paper
Computability and uncountable linear orders. I: Computable categoricity.
Journal of Symbolic Logic
2015-05-20Paper
Lowness for effective Hausdorff dimension
Journal of Mathematical Logic
2015-03-03Paper
Inherent enumerability of strong jump-traceability
Transactions of the American Mathematical Society
2015-02-02Paper
The complexity of computable categoricity
Advances in Mathematics
2014-11-17Paper
Randomness and differentiability in higher dimensions2014-10-30Paper
Strong jump-traceability and Demuth randomness
Proceedings of the London Mathematical Society
2014-04-25Paper
Natural large degree spectra
Computability
2013-10-10Paper
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
Proceedings of the 11th Asian Logic Conference
2013-06-03Paper
Computable categoricity versus relative computable categoricity
Fundamenta Mathematicae
2013-05-10Paper
Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle
Notre Dame Journal of Formal Logic
2013-04-25Paper
A \(K\)-trivial set which is not jump traceable at certain orders
Information Processing Letters
2012-07-25Paper
\(\Delta^0_2\)-categoricity of equivalence structures2011-09-12Paper
Connectedness properties of dimension level sets
Theoretical Computer Science
2011-07-14Paper
Decidability and computability of certain torsion-free abelian groups
Notre Dame Journal of Formal Logic
2010-06-11Paper
Limitwise monotonic functions, sets, and degrees on computable domains
Journal of Symbolic Logic
2010-03-15Paper


Research outcomes over time


This page was built for person: Daniel Turetsky