Switch to: References

Add citations

You must login to add citations.
  1. A blend of methods of recursion theory and topology.Iraj Kalantari & Larry Welch - 2003 - Annals of Pure and Applied Logic 124 (1-3):141-178.
    This paper is a culmination of our new foundations for recursive analysis through recursive topology as reported in Kalantari and Welch 125; 98 87). While in those papers we developed groundwork for an approach to point free analysis and applied recursion theory, in this paper we blend techniques of recursion theory with those of topology to establish new findings. We present several new techniques different from existing ones which yield interesting results. Incidental to our work is a unifying explanation of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
    Download  
     
    Export citation  
     
    Bookmark  
  • Dual realizability in symmetric logic.I. D. Zaslavsky - 2001 - Annals of Pure and Applied Logic 113 (1-3):389-397.
    A variant of the notion of symmetric constructive realizability is introduced where the information about the symmetric constructive truth or falsity of an arithmetical formula is expressed by a single natural number. The methods of transformations of such a realization to the realizations of known kinds and those of reverse transformations are given. The formal arithmetical system based on such a realizability is investigated.
    Download  
     
    Export citation  
     
    Bookmark