Switch to: References

Add citations

You must login to add citations.
  1. Limitwise monotonic functions, sets, and degrees on computable domains.Asher M. Kach & Daniel Turetsky - 2010 - 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.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Automorphisms of η-like computable linear orderings and Kierstead's conjecture.Charles M. Harris, Kyung Il Lee & S. Barry Cooper - 2016 - Mathematical Logic Quarterly 62 (6):481-506.
    We develop an approach to the longstanding conjecture of Kierstead concerning the character of strongly nontrivial automorphisms of computable linear orderings. Our main result is that for any η-like computable linear ordering, such that has no interval of order type η, and such that the order type of is determined by a -limitwise monotonic maximal block function, there exists computable such that has no nontrivial automorphism.
    Download  
     
    Export citation  
     
    Bookmark   1 citation