1. Norman Danner & Chris Pollett (2006). The Weak Pigeonhole Principle for Function Classes in S12. 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)  
     
    My bibliography  
     
    Export citation  
  2. Norman Danner (2001). Review: Harold Simmons, Derivation and Computation. Taking the Curry-Howard Correspondence Seriously. [REVIEW] Bulletin of Symbolic Logic 7 (3):380-383.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Eric Hammer & Norman Danner (1996). Towards a Model Theory of Diagrams. Journal of Philosophical Logic 25 (5):463 - 482.
    A logical system is studied whose well-formed representations consist of diagrams rather than formulas. The system, due to Shin [2, 3], is shown to be complete by an argument concerning maximally consistent sets of diagrams. The argument is complicated by the lack of a straight forward counterpart of atomic formulas for diagrams, and by the lack of a counterpart of negation for most diagrams.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation