Order:
Disambiguations
Klaus Aehlig [5]Klaus T. Aehlig [4]
  1.  21
    Induction and Inductive Definitions in Fragments of Second Order Arithmetic.Klaus Aehlig - 2005 - Journal of Symbolic Logic 70 (4):1087 - 1107.
    A fragment with the same provably recursive functions as n iterated inductive definitions is obtained by restricting second order arithmetic in the following way. The underlying language allows only up to n + 1 nested second order quantifications and those are in such a way, that no second order variable occurs free in the scope of another second order quantifier. The amount of induction on arithmetical formulae only affects the arithmetical consequences of these theories, whereas adding induction for arbitrary formulae (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2. Parameter-Free Polymorphic Types.Klaus Aehlig - 2008 - Annals of Pure and Applied Logic 156 (1):3-12.
    Consider the following restriction of the polymorphically typed lambda calculus . All quantifications are parameter free. In other words, in every universal type α.τ, the quantified variable α is the only free variable in the scope τ of the quantification. This fragment can be locally proven terminating in a system of intuitionistic second-order arithmetic known to have strength of finitely iterated inductive definitions.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  2
    Continuous Normalization for the Lambda-Calculus and Gödel’s T.Klaus Aehlig & Felix Joachimski - 2005 - Annals of Pure and Applied Logic 133 (1-3):39-71.
    Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped λ-calculus and Gödel’s is presented and analysed in the coalgebraic framework of non-wellfounded terms with so-called repetition constructors.The primitive recursive normalization function is uniformly continuous w.r.t. the natural metric on non-wellfounded terms. Furthermore, the number of necessary repetition constructors is locally related to the number of reduction steps needed to reach the normal form and its size.It is also shown how continuous normal (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  4.  7
    Individual Members 2008.Martın Abadi, Yoshihiro Abe, Andreas Abel, Francine F. Abeles, Andrew Aberdein, J. David Abernethy, Bryant Adams, Klaus T. Aehlig, Fritz Aeschbach & Henry Louis Africk - 2008 - Bulletin of Symbolic Logic 14 (4).
  5.  8
    Individual Members 2006.Martın Abadi, Yoshihiro Abe, Francine F. Abeles, Andrew Aberdein, Nathanael Ackerman, Bryant Adams, Klaus T. Aehlig, Fritz Aeschbach, Henry Louis Africk & Bahareh Afshari - 2006 - Bulletin of Symbolic Logic 12 (4):625-681.
  6.  7
    On the Computational Complexity of Cut-Reduction.Klaus Aehlig & Arnold Beckmann - 2010 - Annals of Pure and Applied Logic 161 (6):711-736.
    Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known results on definable functions of certain such theories can be reobtained in a uniform way.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  7. Individual Members 2004.Martın Abadi, Areski Nait Abdallah, Yoshihiro Abe, Francine F. Abeles, Andrew Aberdein, Vicente Aboites, Nathanael Ackerman, John W. Addison Jr, Klaus T. Aehlig & Fritz Aeschbach - 2004 - Bulletin of Symbolic Logic 10 (4).
     
    Export citation  
     
    My bibliography  
  8. Individual Members 2009.Martın Abadi, Yoshihiro Abe, Andreas Abel, Francine F. Abeles, Andrew Aberdein, J. David Abernethy, Nate Ackerman, Bryant Adams, Winifred P. Adams & Klaus T. Aehlig - 2009 - Bulletin of Symbolic Logic 15 (4).
  9. Mathematisches Institut, Ludwig-Maximilians-Universitat Munchen, Theresienstrasse 39, 80333 Munchen, Germany.Klaus Aehlig & Felix Joachimski - 2005 - Annals of Pure and Applied Logic 133 (1-3):39-72.
     
    Export citation  
     
    My bibliography