4 found
  1.  43
    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)  
    Export citation  
    My bibliography   4 citations  
  2. Lawrence Moss & Norman Danner (1997). On the Foundations of Corecursion. 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  
    My bibliography   1 citation  
  3.  3
    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)  
    Export citation  
    My bibliography  
  4.  1
    Norman Danner (2001). Review: Harold Simmons, Derivation and Computation. Taking the Curry-Howard Correspondence Seriously. [REVIEW] Bulletin of Symbolic Logic 7 (3):380-383.