Linda Westrick

    • 9 Citations
    • 2 h-Index
    20142018
    If you made any changes in Pure, your changes will be visible here soon.

    Fingerprint Dive into the research topics where Linda Westrick is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

    • 1 Similar Profiles
    Colouring Mathematics
    Effective Dimension Mathematics
    Reducibility Mathematics
    Uncountable Mathematics
    Partial Order Mathematics
    Differentiability Mathematics
    Free Group Mathematics
    Theorem Mathematics

    Network Recent external collaboration on country level. Dive into details by clicking on the dots.

    Research Output 2014 2018

    • 9 Citations
    • 2 h-Index
    • 7 Article
    3 Citations (Scopus)

    Dimension 1 sequences are close to randoms

    Greenberg, N., Miller, J. S., Shen, A. & Westrick, L., Jan 1 2018, In : Theoretical Computer Science. 705, p. 99-112 14 p.

    Research output: Contribution to journalArticle

    Effective Dimension
    Random Sequence
    If and only if
    Hausdorff Dimension

    Finding bases of uncountable free Abelian groups is usually difficult

    Greenberg, N., Turetsky, D. & Westrick, L. B., Jan 1 2018, In : Transactions of the American Mathematical Society. 370, 6, p. 4483-4508 26 p.

    Research output: Contribution to journalArticle

    Uncountable
    Free Group
    Abelian group
    First-order
    Effective Properties

    Weakly 2-randoms and 1-generics in scott sets

    Westrick, L. B., Mar 1 2018, In : Journal of Symbolic Logic. 83, 1, p. 392-394 3 p.

    Research output: Contribution to journalArticle

    Partial Order
    Turing Degrees
    Turing
    Language
    Model
    4 Citations (Scopus)

    Effectiveness of hindman’s theorem for bounded sums

    Dzhafarov, D. D., Jockusch, C. G., Solomon, R. & Westrick, L. B., Jan 1 2017, In : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 10010, p. 134-142 9 p.

    Research output: Contribution to journalArticle

    Coloring
    Color
    Colouring
    Theorem
    Imply
    1 Citation (Scopus)

    Ramsey’s theorem for singletons and strong computable reducibility

    Dzhafarov, D. D., Patey, L., Solomon, R. & Westrick, L. B., Jan 1 2017, In : Proceedings of the American Mathematical Society. 145, 3, p. 1343-1355 13 p.

    Research output: Contribution to journalArticle

    Open Access
    Reducibility
    Coloring
    Colouring
    Theorem
    Partial