12 found
Order:
  1.  45
    Reverse Mathematics, Computability, and Partitions of Trees.Jennifer Chubb, Jeffry L. Hirst & Timothy H. McNicholl - 2009 - Journal of Symbolic Logic 74 (1):201-215.
    We examine the reverse mathematics and computability theory of a form of Ramsey's theorem in which the linear n-tuples of a binary tree are colored.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  11
    Asymptotic Density and the Ershov Hierarchy.Rod Downey, Carl Jockusch, Timothy H. McNicholl & Paul Schupp - 2015 - Mathematical Logic Quarterly 61 (3):189-195.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  24
    Intrinsic Reducibilities.Timothy H. McNicholl - 2000 - Mathematical Logic Quarterly 46 (3):393-407.
    Let equation image. We show that for many reducibilities, the requirement that a relation be intrinsically reducible to the α-th jump of a countable mode A has a syntactic equivalent. Furthermore, we show that many reducibilities coincide in such a situation.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  4
    Analytic Computable Structure Theory and $$L^P$$Lp -Spaces Part 2.Tyler Brown & Timothy H. McNicholl - 2020 - Archive for Mathematical Logic 59 (3-4):427-443.
    Suppose \ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by determining the degrees of categoricity of the separable \ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we ascertain the complexity of associated projection maps.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  1
    On the Complexity of Classifying Lebesgue Spaces.Tyler A. Brown, Timothy H. Mcnicholl & Alexander G. Melnikov - forthcoming - Journal of Symbolic Logic:1-35.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  21
    A Uniformly Computable Implicit Function Theorem.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (3):272-279.
    We prove uniformly computable versions of the Implicit Function Theorem in its differentiable and non-differentiable forms. We show that the resulting operators are not computable if information about some of the partial derivatives of the implicitly defining function is omitted. Finally, as a corollary, we obtain a uniformly computable Inverse Function Theorem, first proven by M. Ziegler.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  19
    Computing Links and Accessing Arcs.Timothy H. McNicholl - 2013 - Mathematical Logic Quarterly 59 (1-2):101-107.
    Sufficient conditions are given for the computation of an arc that accesses a point on the boundary of an open subset of the plane from a point within the set. The existence of a not-computably-accessible but computable point on a computably compact arc is also demonstrated.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  8. Continuous Logic and Embeddings of Lebesgue Spaces.Timothy H. McNicholl - 2021 - Archive for Mathematical Logic 60 (1-2):105-119.
    We use the compactness theorem of continuous logic to give a new proof that Lr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^r$$\end{document} isometrically embeds into Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^p$$\end{document} whenever 1≤p≤r≤2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1 \le p \le r \le 2$$\end{document}. We will also give a proof for the complex case. This will involve a new characterization of complex Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  11
    Effective Embeddings Into Strong Degree Structures.Timothy H. McNicholl - 2003 - Mathematical Logic Quarterly 49 (3):219.
    We show that any partial order with a Σ3 enumeration can be effectively embedded into any partial order obtained by imposing a strong reducibility such as ≤tt on the c. e. sets. As a consequence, we obtain that the partial orders that result from imposing a strong reducibility on the sets in a level of the Ershov hiearchy below ω + 1 are co-embeddable.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  19
    On the Commutativity of Jumps.Timothy H. McNicholl - 2000 - Journal of Symbolic Logic 65 (4):1725-1748.
    We study the following classes: Q* (r 1 A 1 ,..., r kA k ) which is defined to be the collection of all sets that can be computed by a Turing machine that on any input makes a total of r i queries to A i for all i ∈ {1,..., k}. Q(r 1A 1 ,...,r kA k ) which is defined like Q* (r 1A 1 ,..., r kA k ) except that queries to A i must be (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  11.  26
    On the Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets.Timothy H. McNicholl - 2001 - Journal of Symbolic Logic 66 (4):1543-1560.
    Call a set A n-correctable if every set Turing reducible to A via a Turing machine that on any input makes at most n queries is Turing reducible to A via a Turing machine that on any input makes at most n-queries and on any input halts no matter what answers are given to its queries. We show that if a c.e. set A is n-correctable for some n ≥ 2, then it is n-correctable for all n. We show that (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  12.  12
    Uniformly Computable Aspects of Inner Functions: Estimation and Factorization.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (5):508-518.
    The theory of inner functions plays an important role in the study of bounded analytic functions. Inner functions are also useful in applied mathematics. Two foundational results in this theory are Frostman's Theorem and the Factorization Theorem. We prove a uniformly computable version of Frostman's Theorem. We then show that the Factorization Theorem is not uniformly computably true. We then show that for an inner function u with infinitely many zeros, the Blaschke sum of u provides the exact amount of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark