Order:
  1.  52
    Simplicity in Effective Topology.Iraj Kalantari & Anne Leggett - 1982 - Journal of Symbolic Logic 47 (1):169-183.
    The recursion-theoretic study of mathematical structures other thanωis now a field of much activity. Analysis and algebra are two such structures which have been studied for their effective contents. Studies in analysis began with the work of Specker on nonconstructive proofs in analysis [16] and in Lacombe's inspiring notes on relevant notions of recursive analysis [8]. Studies in algebra originated in the work of Frolich and Shepherdson on effective extensions of explicit fields [1] and in Rabin's study of computable fields (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  2.  22
    Maximality in Effective Topology.Iraj Kalantari & Anne Leggett - 1983 - Journal of Symbolic Logic 48 (1):100-112.
  3.  21
    Types of Simple Α-Recursively Enumerable Sets.Anne Leggett & Richard A. Shore - 1976 - Journal of Symbolic Logic 41 (3):681-694.
  4.  6
    Α-Degrees of Maximal Α-R.E. Sets.Anne Leggett - 1978 - Journal of Symbolic Logic 43 (3):456-474.
  5.  15
    C. T. Chong. Techniques of Admissible Recursion Theory. Lecture Notes in Mathematics, Vol. 1106. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1984, Ix + 214 Pp. [REVIEW]Anne Leggett - 1987 - Journal of Symbolic Logic 52 (1):285-287.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6.  10
    Review: Marvin L. Bittinger, Logic, Proof, and Sets. [REVIEW]Anne Leggett - 1985 - Journal of Symbolic Logic 50 (3):860-862.
  7.  5
    $Alpha$-Degrees of Maximal $Alpha$-R.E. Sets.Anne Leggett - 1978 - Journal of Symbolic Logic 43 (3):456-474.
  8. Review: C. T. Chong, Techniques of Admissible Recursion Theory. [REVIEW]Anne Leggett - 1987 - Journal of Symbolic Logic 52 (1):285-287.
     
    Export citation  
     
    Bookmark