The following pages link to Daniel D. Turetsky (Q592858):
Displayed 33 items.
- Item:Q592858 (redirect page) (← links)
- Item:Q436597 (redirect page) (← links)
- A \(K\)-trivial set which is not jump traceable at certain orders (Q436598) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- Connectedness properties of dimension level sets (Q551185) (← links)
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations (Q904324) (← links)
- Decidability and computability of certain torsion-free abelian groups (Q976537) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- Two more characterizations of \(K\)-triviality (Q1750296) (← links)
- Galvin's ``racing pawns'' game, internal hyperarithmetic comprehension, and the law of excluded middle (Q1949169) (← links)
- Degree spectra of structures relative to equivalences (Q2011365) (← links)
- Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Natural Large Degree Spectra (Q2851184) (← links)
- (Q3091709) (← links)
- LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS (Q3188324) (← links)
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES (Q4579805) (← links)
- Effectively closed subgroups of the infinite symmetric group (Q4691363) (← links)
- Computable categoricity versus relative computable categoricity (Q4921488) (← links)
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS (Q4922660) (← links)
- Lowness for effective Hausdorff dimension (Q5176257) (← links)
- Limitwise monotonic functions, sets, and degrees on computable domains (Q5190192) (← links)
- Effective aspects of algorithmically random structures (Q5211070) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY (Q5251361) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
- Strong jump-traceability and Demuth randomness (Q5411925) (← links)
- Inherent enumerability of strong jump-traceability (Q5496646) (← links)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)
- Randomness and differentiability in higher dimensions (Q6255969) (← links)
- Martin-L\"of reducibility and cost functions (Q6288540) (← links)
- Realizing Computably Enumerable Degrees in Separating Classes (Q6347577) (← links)
- Computable classifications of continuous, transducer, and regular functions (Q6351664) (← links)
- Limit Complexities, Minimal Descriptions, and $n$-Randomness (Q6407048) (← links)
- Normality, Relativization, and Randomness (Q6463817) (← links)