Arnold Beckmann

2007
21	EE	Arnold Beckmann: Proofs, Programs and Abstract Complexity. CSL 2007: 4-5
20	EE	Klaus Aehlig, Arnold Beckmann: Propositional Logic for Circuit Classes. CSL 2007: 512-526
19	EE	Klaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction CoRR abs/0712.1499: (2007)
18	EE	Arnold Beckmann, Benedikt Löwe, Dag Normann: Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. 17(6): 1021-1023 (2007)
2006
17		Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings Springer 2006
2005
16	EE	Arnold Beckmann, Jeremy Avigad, Georg Moser: Preface. Ann. Pure Appl. Logic 136(1-2): 1-2 (2005)
15	EE	Arnold Beckmann, Samuel R. Buss: Separation results for the size of constant-depth propositional proofs. Ann. Pure Appl. Logic 136(1-2): 30-55 (2005)
14	EE	Arnold Beckmann: Uniform Proof Complexity. J. Log. Comput. 15(4): 433-446 (2005)
13	EE	Arnold Beckmann, Jan Johannsen: An unexpected separation result in Linearly Bounded Arithmetic. Math. Log. Q. 51(2): 191-200 (2005)
2004
12	EE	Arnold Beckmann: Preservation theorems and restricted consistency statements in bounded arithmetic. Ann. Pure Appl. Logic 126(1-3): 255-280 (2004)
2003
11		Arnold Beckmann, Chris Pollett, Samuel R. Buss: Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Logic 120(1-3): 197-223 (2003)
10	EE	Arnold Beckmann, Samuel R. Buss, Chris Pollett: Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. Ann. Pure Appl. Logic 123(1-3): 291- (2003)
9	EE	Arnold Beckmann: Dynamic ordinal analysis. Arch. Math. Log. 42(4): 303-334 (2003)
8	EE	Arnold Beckmann: Height restricted constant depth LK Electronic Colloquium on Computational Complexity (ECCC) 10(034): (2003)
2002
7	EE	Arnold Beckmann: Resolution Refutations and Propositional Proofs with Height-Restrictions. CSL 2002: 599-612
6	EE	Arnold Beckmann: A Note on Universal Measures for Weak Implicit Computational Complexity. LPAR 2002: 53-67
5		Arnold Beckmann: Proving Consistency of Equational Theories in Bounded Arithmetic. J. Symb. Log. 67(1): 279-296 (2002)
4		Arnold Beckmann: Notations for exponentiation. Theor. Comput. Sci. 288(1): 3-19 (2002)
2001
3		Arnold Beckmann: Exact Bounds for Lengths of Reductions in Typed lambda-Calculus. J. Symb. Log. 66(3): 1277-1285 (2001)
2000
2	EE	Arnold Beckmann, Andreas Weiermann: Analyzing Gödel's T Via Expanded Head Reduction Trees. Math. Log. Q. 46(4): 517-536 (2000)
1998
1		Arnold Beckmann, Wolfram Pohlers: Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. Ann. Pure Appl. Logic 94(1-3): 7-19 (1998)

Coauthor Index

1	Klaus Aehlig	[19] [20]
2	Jeremy Avigad	[16]
3	Ulrich Berger	[17]
4	Samuel R. Buss	[10] [11] [15]
5	Jan Johannsen	[13]
6	Benedikt Löwe	[17] [18]
7	Georg Moser	[16]
8	Dag Normann	[18]
9	Wolfram Pohlers	[1]
10	Chris Pollett	[10] [11]
11	J. V. Tucker (John V. Tucker)	[17]
12	Andreas Weiermann	[2]

Colors in the list of coauthors