The SCEAS System
Navigation Menu

Search the dblp DataBase


Andreas Weiermann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Weiermann
    Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:556-570 [Conf]
  2. Andreas Weiermann
    Proving Termination for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:419-428 [Conf]
  3. Georg Moser, Andreas Weiermann
    Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:296-310 [Conf]
  4. E. A. Cichon, Andreas Weiermann
    Term Rewriting Theory for the Primitive Recursive Functions. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:83, n:3, pp:199-223 [Journal]
  5. Michael Rathjen, Andreas Weiermann
    Proof-Theoretic Investigations on Kruskal's Theorem. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:60, n:1, pp:49-88 [Journal]
  6. Andreas Weiermann
    Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:189-218 [Journal]
  7. Andreas Weiermann
    Sometimes Slow Growing is Fast Growing. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:90, n:1-3, pp:91-99 [Journal]
  8. Andreas Weiermann
    An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:- [Journal]
  9. Andreas Weiermann
    Complexity Bounds for Some Finite Forms of Kruskal's Theorem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:18, n:5, pp:463-488 [Journal]
  10. Andreas Weiermann
    Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:609-628 [Journal]
  11. Andreas Weiermann
    An application of graphical enumeration to PA*. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:1, pp:5-16 [Journal]
  12. Andreas Weiermann
    Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:664-671 [Journal]
  13. Andreas Weiermann
    A Functorial Property of the Aczel-Buchholz-Feferman Function. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:3, pp:945-955 [Journal]
  14. Andreas Weiermann
    How to Characterize Provably Total Functions by Local Predicativity. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:1, pp:52-69 [Journal]
  15. Andreas Weiermann
    How Is It that Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:4, pp:1348-1370 [Journal]
  16. Adam Cichon, Wilfried Buchholz, Andreas Weiermann
    A Uniform Approach to Fundamental Sequences and Hierarchies. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1994, v:40, n:, pp:273-286 [Journal]
  17. Arnold Beckmann, Andreas Weiermann
    Analyzing Gödel's T Via Expanded Head Reduction Trees. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:517-536 [Journal]
  18. Andreas Weiermann
    Gamma0 May Be Minimal Subrecursively Inaccessible. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:3, pp:397-408 [Journal]
  19. Andreas Weiermann
    A Simplified Functorial Construction of the Veblen Hierarchy. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:269-273 [Journal]
  20. Andreas Weiermann
    An Order-Theoretic Characterization of the Schütte-Veblen-Hierarchy. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:367-383 [Journal]
  21. Benjamin Blankertz, Andreas Weiermann
    A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:62, n:3, pp:399-427 [Journal]
  22. Andreas Weiermann
    Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:355-362 [Journal]
  23. Henryk Kotlarski, Bozena Piekart, Andreas Weiermann
    More on lower bounds for partitioning alpha-large sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2007, v:147, n:3, pp:113-126 [Journal]

  24. Phase Transitions for Weakly Increasing Sequences. [Citation Graph (, )][DBLP]

  25. A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. [Citation Graph (, )][DBLP]

  26. A Miniaturisation of Ramsey's Theorem. [Citation Graph (, )][DBLP]

  27. Complexity of Gödel's T in lambda-Formulation. [Citation Graph (, )][DBLP]

  28. Bounding derivation lengths with functions from the slow growing hierarchy. [Citation Graph (, )][DBLP]

  29. Characterizing the elementary recursive functions by a fragment of Gödel's T. [Citation Graph (, )][DBLP]

  30. A term rewriting characterization of the polytime functions and related complexity classes. [Citation Graph (, )][DBLP]

  31. A proof of strongly uniform termination for Gödel's TT by methods from local predicativity. [Citation Graph (, )][DBLP]

  32. Phase transitions for Gödel incompleteness. [Citation Graph (, )][DBLP]

  33. Classifying the phase transition threshold for Ackermannian functions. [Citation Graph (, )][DBLP]

  34. Classifying the Provably Total Functions of PA. [Citation Graph (, )][DBLP]

Search in 0.033secs, Finished in 0.035secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002