Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   595 citations  
  • Computability theory and linear orders.Rod Downey - 1998 - In IUrii Leonidovich Ershov (ed.), Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Reverse mathematics of mf spaces.Carl Mummert - 2006 - Journal of Mathematical Logic 6 (2):203-232.
    This paper gives a formalization of general topology in second-order arithmetic using countably based MF spaces. This formalization is used to study the reverse mathematics of general topology. For each poset P we let MF denote the set of maximal filters on P endowed with the topology generated by {Np | p ∈ P}, where Np = {F ∈ MF | p ∈ F}. We define a countably based MF space to be a space of the form MF for some (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Subsystems of Second Order Arithmetic.Stephen George Simpson - 1999 - Springer Verlag.
    Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...
    Download  
     
    Export citation  
     
    Bookmark   131 citations