12 found
Order:
  1. Daniel Leivant (1980). Innocuous Substitutions. Journal of Symbolic Logic 45 (2):363-368.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2. Daniel Leivant (1985). Syntactic Translations and Provably Recursive Functions. Journal of Symbolic Logic 50 (3):682-688.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  3.  21
    Daniel Leivant (1981). On the Proof Theory of the Modal Logic for Arithmetic Provability. Journal of Symbolic Logic 46 (3):531-538.
  4.  8
    Daniel Leivant (1983). The Optimality of Induction as an Axiomatization of Arithmetic. Journal of Symbolic Logic 48 (1):182-184.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  5. Daniel Maurice Raphaël Leivant (1979). Absoluteness of Intuitionistic Logic. Mathematisch Centrum.
  6.  4
    Daniel Leivant (1981). Implicational Complexity in Intuitionistic Arithmetic. Journal of Symbolic Logic 46 (2):240-248.
  7.  1
    Daniel Leivant (1990). Markov's Rule Revisited. Archive for Mathematical Logic 30 (2):125-127.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  8.  1
    Daniel Leivant (1999). Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity. Annals of Pure and Applied Logic 96 (1-3):209-229.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  9. Samson Abramsky, John Baldwin, Craig Boutilier, Daniel Leivant & Francisco Miraglia (1999). National Park of Itatiaia, Rio de Janeiro, Brazil, May 25–28, 1999. Bulletin of Symbolic Logic 5 (3).
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  10. Daniel Leivant (1979). Assumption Classes in Natural Deduction. Mathematical Logic Quarterly 25 (1‐2):1-4.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  11. Daniel Leivant (1979). Assumption Classes in Natural Deduction. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (1-2):1-4.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. Daniel Leivant (2002). Intrinsic Reasoning About Functional Programs I: First Order Theories. Annals of Pure and Applied Logic 114 (1-3):117-153.
    We propose a rudimentary formal framework for reasoning about recursion equations over inductively generated data. Our formalism admits all equational programs , and yet singles out none. While being simple, this framework has numerous extensions and applications. Here we lay out the basic concepts and definitions; show that the deductive power of our formalism is similar to that of Peano's Arithmetic; prove a strong normalization theorem; and exhibit a mapping from natural deduction derivations to an applied λ -calculus, à la (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography