Arnold Beckmann

	2012
39		Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe: Computability in Europe 2009. Ann. Pure Appl. Logic 163(5): 483-484 (2012)
38		Arnold Beckmann, Benedikt Löwe: Computability in Europe 2008. J. Log. Comput. 22(2): 163-164 (2012)
37		Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe: Computability in Europe 2009. Theory Comput. Syst. 51(1): 1-3 (2012)
	2011
36		Arnold Beckmann, Samuel R. Buss: Corrected upper bounds for free-cut elimination. Theor. Comput. Sci. 412(39): 5433-5445 (2011)
35		Arnold Beckmann, Benedikt Löwe: Computability in Europe 2008. Theory Comput. Syst. 48(3): 614-616 (2011)
	2010
34		Klaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction. Ann. Pure Appl. Logic 161(6): 711-736 (2010)
33		Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe: Computability in Europe 2008. Arch. Math. Log. 49(2): 119-121 (2010)
	2009
32		Arnold Beckmann: A Characterisation of Definable NP Search Problems in Peano Arithmetic. WoLLIC 2009: 1-12
	2008
31		Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings Springer 2008
30		Arnold Beckmann, Faron Moller: On the Complexity of Parity Games. BCS Int. Acad. Conf. 2008: 237-248
29		Klaus Aehlig, Arnold Beckmann: On the Computational Complexity of Cut-Reduction. LICS 2008: 284-293
28		Arnold Beckmann, Martin Goldstern, Norbert Preining: Continuous Fraïssé Conjecture. Order 25(4): 281-298 (2008)
27		Arnold Beckmann, Edwin J. Beggs, Benedikt Löwe: From Gödel to Einstein: Computability between logic and physics at CiE 2006. Theor. Comput. Sci. 394(3): 141-143 (2008)
26		Arnold Beckmann, Benedikt Löwe: Computability in Europe 2006. Theory Comput. Syst. 43(3-4): 295-297 (2008)
	2007
25		Arnold Beckmann: Proofs, Programs and Abstract Complexity. CSL 2007: 4-5
24		Klaus Aehlig, Arnold Beckmann: Propositional Logic for Circuit Classes. CSL 2007: 512-526
23		Klaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction CoRR abs/0712.1499: (2007)
22		Arnold Beckmann, Benedikt Löwe, Dag Normann: Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. 17(6): 1021-1023 (2007)
21		Arnold Beckmann, Norbert Preining: Linear Kripke frames and Gödel logics. J. Symb. Log. 72(1): 26-44 (2007)
	2006
20		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
19		Arnold Beckmann, Jeremy Avigad, Georg Moser: Preface. Ann. Pure Appl. Logic 136(1-2): 1-2 (2005)
18		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)
17		Arnold Beckmann: Uniform Proof Complexity. J. Log. Comput. 15(4): 433-446 (2005)
16		Arnold Beckmann, Jan Johannsen: An unexpected separation result in Linearly Bounded Arithmetic. Math. Log. Q. 51(2): 191-200 (2005)
	2004
15		Arnold Beckmann: Preservation theorems and restricted consistency statements in bounded arithmetic. Ann. Pure Appl. Logic 126(1-3): 255-280 (2004)
	2003
14		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)
13		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)
12		Arnold Beckmann: Dynamic ordinal analysis. Arch. Math. Log. 42(4): 303-334 (2003)
11		Arnold Beckmann: Height restricted constant depth LK Electronic Colloquium on Computational Complexity (ECCC) 10(034): (2003)
	2002
10		Arnold Beckmann: Resolution Refutations and Propositional Proofs with Height-Restrictions. CSL 2002: 599-612
9		Arnold Beckmann: A Note on Universal Measures for Weak Implicit Computational Complexity. LPAR 2002: 53-67
8		Arnold Beckmann: A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. Arch. Math. Log. 41(3): 251-257 (2002)
7		Arnold Beckmann: Proving Consistency of Equational Theories in Bounded Arithmetic. J. Symb. Log. 67(1): 279-296 (2002)
6		Arnold Beckmann: Notations for exponentiation. Theor. Comput. Sci. 288(1): 3-19 (2002)
	2001
5		Arnold Beckmann: Exact Bounds for Lengths of Reductions in Typed lambda-Calculus. J. Symb. Log. 66(3): 1277-1285 (2001)
	2000
4		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)
3		Arnold Beckmann, Andreas Weiermann: Analyzing Gödel's T Via Expanded Head Reduction Trees. Math. Log. Q. 46(4): 517-536 (2000)
	1998
2		Arnold Beckmann, Wolfram Pohlers: Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. Ann. Pure Appl. Logic 94(1-3): 7-19 (1998)
	1996
1		Arnold Beckmann, Andreas Weiermann: A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Log. 36(1): 11-30 (1996)

Coauthor Index

1	Klaus Aehlig	[23] [24] [29] [34]
2	Klaus Ambos-Spies	[39]
3	Jeremy Avigad	[19]
4	Edwin J. Beggs	[27]
5	Ulrich Berger	[20]
6	Samuel R. Buss	[13] [14] [18] [36] [39]
7	Costas Dimitracopoulos	[31] [33]
8	Martin Goldstern	[28]
9	Jan Johannsen	[16]
10	Benedikt Löwe	[20] [22] [26] [27] [31] [33] [35] [37] [38] [39]
11	Wolfgang Merkle	[37]
12	Faron Moller	[30]
13	Georg Moser	[19]
14	Dag Normann	[22]
15	Wolfram Pohlers	[2]
16	Chris Pollett (Christopher Pollett)	[13] [14]
17	Norbert Preining	[21] [28]
18	J. V. Tucker (John V. Tucker)	[20]
19	Andreas Weiermann	[1] [3] [4]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page