- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j41 |      | Sy-David Friedman, Michael Rathjen, Andreas Weiermann: Slow consistency. Ann. Pure Appl. Logic 164(3): 382-393 (2013) |
| 2012 | ||
| j40 | | Lew Gordeev, Andreas Weiermann: Phase transitions of iterated Higman-style well-partial-orderings. Arch. Math. Log. 51(1-2): 127-161 (2012) |
| j39 | | Michiel De Smet, Andreas Weiermann: Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. Ann. Pure Appl. Logic 163(6): 669-680 (2012) |
| j38 | | Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann: Streamlined subrecursive degree theory. Ann. Pure Appl. Logic 163(6): 698-716 (2012) |
| j37 | | Gunnar Wilken, Andreas Weiermann: Derivation Lengths Classification of Gödel's T Extending Howard's Assignment. Logical Methods in Computer Science 8(1) (2012) |
| j36 | | Michiel De Smet, Andreas Weiermann: Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences. J. Log. Comput. 22(2): 207-211 (2012) |
| j35 | | Dimiter Skordev, Andreas Weiermann, Ivan Georgiev: M2-computable real numbers. J. Log. Comput. 22(4): 899-925 (2012) |
| c8 | | Andreas Weiermann, Alan R. Woods: Some Natural Zero One Laws for Ordinals Below ε 0. CiE 2012: 723-732 |
| 2011 | ||
| j34 | | Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann: Sharp thresholds for hypergraph regressive Ramsey numbers. J. Comb. Theory, Ser. A 118(2): 558-585 (2011) |
| j33 | | Andreas Weiermann, Gunnar Wilken: Ordinal arithmetic with simultaneously defined theta-functions. Math. Log. Q. 57(2): 116-132 (2011) |
| 2010 | ||
| c7 | | |
| 2009 | ||
| j32 | | Andreas Weiermann: Phase transitions for Gödel incompleteness. Ann. Pure Appl. Logic 157(2-3): 281-296 (2009) |
| j31 | | Eran Omri, Andreas Weiermann: Classifying the phase transition threshold for Ackermannian functions. Ann. Pure Appl. Logic 158(3): 156-162 (2009) |
| c6 | | Andreas Weiermann: A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. CiE 2009: 488-498 |
| c5 | | |
| 2008 | ||
| j30 | | Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann: Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. J. Comb. Theory, Ser. A 115(6): 1036-1055 (2008) |
| c4 | | Michiel De Smet, Andreas Weiermann: Phase Transitions for Weakly Increasing Sequences. CiE 2008: 168-174 |
| 2007 | ||
| j29 | | Henryk Kotlarski, Bozena Piekart, Andreas Weiermann: More on lower bounds for partitioning alpha-large sets. Ann. Pure Appl. Logic 147(3): 113-126 (2007) |
| j28 | | Arnoud den Boer, Andreas Weiermann: A Sharp Phase Transition Threshold for Elementary Descent Recursive Functions. J. Log. Comput. 17(6): 1083-1098 (2007) |
| j27 | | Andreas Weiermann: Phase transition thresholds for some Friedman-style independence results. Math. Log. Q. 53(1): 4-18 (2007) |
| 2006 | ||
| j26 | | Andreas Weiermann: Classifying the Provably Total Functions of PA. Bulletin of Symbolic Logic 12(2): 177-190 (2006) |
| j25 | | Andreas Weiermann: An extremely sharp phase transition threshold for the slow growing hierarchy. Mathematical Structures in Computer Science 16(5): 925-946 (2006) |
| c3 | | Andreas Weiermann: Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. CiE 2006: 556-570 |
| 2005 | ||
| j24 | | Andreas Weiermann: Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. Ann. Pure Appl. Logic 136(1-2): 189-218 (2005) |
| 2003 | ||
| j23 | | Andreas Weiermann: An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discrete Mathematics & Theoretical Computer Science 6(1) (2003) |
| j22 |  | |
| c2 | | Georg Moser, Andreas Weiermann: Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA 2003: 296-310 |
| 2001 | ||
| j21 | | Andreas Weiermann: Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function. J. Symb. Log. 66(2): 609-628 (2001) |
| j20 | | Andreas Weiermann: Gamma0 May Be Minimal Subrecursively Inaccessible. Math. Log. Q. 47(3): 397-408 (2001) |
| 2000 | ||
| j19 | | Arnold Beckmann, Andreas Weiermann: Characterizing the elementary recursive functions by a fragment of Gödel's T. Arch. Math. Log. 39(7): 475-491 (2000) |
| j18 | | Arnold Beckmann, Andreas Weiermann: Analyzing Gödel's T Via Expanded Head Reduction Trees. Math. Log. Q. 46(4): 517-536 (2000) |
| 1999 | ||
| j17 | | Benjamin Blankertz, Andreas Weiermann: A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems. Studia Logica 62(3): 399-427 (1999) |
| 1998 | ||
| j16 | | Andreas Weiermann: Bounding derivation lengths with functions from the slow growing hierarchy. Arch. Math. Log. 37(5-6): 427-441 (1998) |
| j15 | | Andreas Weiermann: How Is It that Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. J. Symb. Log. 63(4): 1348-1370 (1998) |
| 1997 | ||
| j14 | | Andreas Weiermann: A proof of strongly uniform termination for Gödel's TT by methods from local predicativity. Arch. Math. Log. 36(6): 445-460 (1997) |
| j13 | | E. A. Cichon, Andreas Weiermann: Term Rewriting Theory for the Primitive Recursive Functions. Ann. Pure Appl. Logic 83(3): 199-223 (1997) |
| j12 | | Andreas Weiermann: Sometimes Slow Growing is Fast Growing. Ann. Pure Appl. Logic 90(1-3): 91-99 (1997) |
| 1996 | ||
| j11 | | Arnold Beckmann, Andreas Weiermann: A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Log. 36(1): 11-30 (1996) |
| j10 | | Andreas Weiermann: How to Characterize Provably Total Functions by Local Predicativity. J. Symb. Log. 61(1): 52-69 (1996) |
| 1995 | ||
| j9 | | Andreas Weiermann: Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. Arch. Math. Log. 34(5): 313-330 (1995) |
| j8 | | Andreas Weiermann: Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths. Theor. Comput. Sci. 139(1&2): 355-362 (1995) |
| 1994 | ||
| j7 | | Andreas Weiermann: Complexity Bounds for Some Finite Forms of Kruskal's Theorem. J. Symb. Comput. 18(5): 463-488 (1994) |
| j6 | | Andreas Weiermann: A Functorial Property of the Aczel-Buchholz-Feferman Function. J. Symb. Log. 59(3): 945-955 (1994) |
| j5 | | Adam Cichon, Wilfried Buchholz, Andreas Weiermann: A Uniform Approach to Fundamental Sequences and Hierarchies. Math. Log. Q. 40: 273-286 (1994) |
| 1993 | ||
| j4 | | Michael Rathjen, Andreas Weiermann: Proof-Theoretic Investigations on Kruskal's Theorem. Ann. Pure Appl. Logic 60(1): 49-88 (1993) |
| j3 | | Andreas Weiermann: Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions. J. Symb. Log. 58(2): 664-671 (1993) |
| j2 | | Andreas Weiermann: A Simplified Functorial Construction of the Veblen Hierarchy. Math. Log. Q. 39: 269-273 (1993) |
| j1 | | Andreas Weiermann: An Order-Theoretic Characterization of the Schütte-Veblen-Hierarchy. Math. Log. Q. 39: 367-383 (1993) |
| 1991 | ||
| c1 | | |
Colors in the list of coauthors
Last update Tue May 21 18:42:31 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page