8 found
Order:
Disambiguations:
Daniel Turetsky [5]Daniel D. Turetsky [3]
  1.  9
    Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov & Daniel Turetsky (2010). Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame Journal of Formal Logic 51 (1):85-96.
    We study completely decomposable torsion-free abelian groups of the form $\mathcal{G}_S := \oplus_{n \in S} \mathbb{Q}_{p_n}$ for sets $S \subseteq \omega$. We show that $\mathcal{G}_S$has a decidable copy if and only if S is $\Sigma^0_2$and has a computable copy if and only if S is $\Sigma^0_3$.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  2.  17
    Chris Conidis, Noam Greenberg & Daniel Turetsky (2013). Galvin’s “Racing Pawns” Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle. Notre Dame Journal of Formal Logic 54 (2):233-252.
    We show that the fact that the first player wins every instance of Galvin’s “racing pawns” game is equivalent to arithmetic transfinite recursion. Along the way we analyze the satisfaction relation for infinitary formulas, of “internal” hyperarithmetic comprehension, and of the law of excluded middle for such formulas.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  3.  17
    Asher M. Kach & Daniel Turetsky (2010). Limitwise Monotonic Functions, Sets, and Degrees on Computable Domains. Journal of Symbolic Logic 75 (1):131-154.
    We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing limitwise monotonic on various computable domains. As applications, we provide a characterization of the sets S with computable increasing η-representations using support increasing limitwise monotonic sets on ℚ and note relationships between the class of order-computable sets and the class of support increasing limitwise monotonic sets on certain domains.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  4. Ekaterina Fokina, Bakhadyr Khoussainov, Pavel Semukhin & Daniel Turetsky (2016). Linear Orders Realized by C.E. Equivalence Relations. Journal of Symbolic Logic 81 (2):463-482.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  5. Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky (2015). Computability and Uncountable Linear Orders I: Computable Categoricity. Journal of Symbolic Logic 80 (1):116-144.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  6. Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky (2015). Computability and Uncountable Linear Orders II: Degree Spectra. Journal of Symbolic Logic 80 (1):145-178.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7. Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky & Rebecca Weber (2014). Lowness for Effective Hausdorff Dimension. Journal of Mathematical Logic 14 (2):1450011.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8. Daniel Turetsky (2012). Several Papers Concerning Computable Categoricity. Bulletin of Symbolic Logic 18 (1):131.