4 found
Order:
  1.  10
    On the Foundations of Corecursion.Lawrence Moss & Norman Danner - 1997 - Logic Journal of the IGPL 5 (2):231-257.
    We consider foundational questions related to the definition of functions by corecursion. This method is especially suited to functions into the greatest fixed point of some monotone operator, and it is most applicable in the context of non-wellfounded sets. We review the work on the Special Final Coalgebra Theorem of Aczel [1] and the Corecursion Theorem of Barwise and Moss [4]. We offer a condition weaker than Aczel's condition of uniformity on maps, and then we prove a result relating the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  13
    Simmons Harold. Derivation and Computation. Taking the Curry-Howard Correspondence Seriously. Cambridge Tracts in Theoretical Computer Science, Vol. 51. Cambridge University Press, Cambridge, New York, Etc., 2000, Xxv + 384 Pp. [REVIEW]Norman Danner - 2001 - Bulletin of Symbolic Logic 7 (3):380-383.
  3.  13
    The Weak Pigeonhole Principle for Function Classes in S12.Norman Danner & Chris Pollett - 2006 - Mathematical Logic Quarterly 52 (6):575-584.
    It is well known that S12 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective weak pigeonhole principle in S12 for provably weaker function classes.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  4. Derivation and Computation. Taking the Curry-Howard Correspondence Seriously.Norman Danner - 2001 - Bulletin of Symbolic Logic 7 (3):380-383.
    Direct download  
     
    Export citation  
     
    Bookmark