| 2008 |
|---|
| 27 | | 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 |
| 26 | EE | Klaus Aehlig,
Arnold Beckmann:
On the Computational Complexity of Cut-Reduction.
LICS 2008: 284-293 |
| 25 | EE | 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) |
| 2007 |
|---|
| 24 | EE | Arnold Beckmann:
Proofs, Programs and Abstract Complexity.
CSL 2007: 4-5 |
| 23 | EE | Klaus Aehlig,
Arnold Beckmann:
Propositional Logic for Circuit Classes.
CSL 2007: 512-526 |
| 22 | EE | Klaus Aehlig,
Arnold Beckmann:
On the computational complexity of cut-reduction
CoRR abs/0712.1499: (2007) |
| 21 | EE | Arnold Beckmann,
Benedikt Löwe,
Dag Normann:
Logical Approaches to Computational Barriers: CiE 2006.
J. Log. Comput. 17(6): 1021-1023 (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 | EE | Arnold Beckmann,
Jeremy Avigad,
Georg Moser:
Preface.
Ann. Pure Appl. Logic 136(1-2): 1-2 (2005) |
| 18 | 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) |
| 17 | EE | Arnold Beckmann:
Uniform Proof Complexity.
J. Log. Comput. 15(4): 433-446 (2005) |
| 16 | EE | Arnold Beckmann,
Jan Johannsen:
An unexpected separation result in Linearly Bounded Arithmetic.
Math. Log. Q. 51(2): 191-200 (2005) |
| 2004 |
|---|
| 15 | EE | 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 | 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) |
| 12 | EE | Arnold Beckmann:
Dynamic ordinal analysis.
Arch. Math. Log. 42(4): 303-334 (2003) |
| 11 | EE | Arnold Beckmann:
Height restricted constant depth LK
Electronic Colloquium on Computational Complexity (ECCC) 10(034): (2003) |
| 2002 |
|---|
| 10 | EE | Arnold Beckmann:
Resolution Refutations and Propositional Proofs with Height-Restrictions.
CSL 2002: 599-612 |
| 9 | EE | Arnold Beckmann:
A Note on Universal Measures for Weak Implicit Computational Complexity.
LPAR 2002: 53-67 |
| 8 | EE | 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 | EE | 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 | EE | 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 | EE | Arnold Beckmann,
Andreas Weiermann:
A term rewriting characterization of the polytime functions and related complexity classes.
Arch. Math. Log. 36(1): 11-30 (1996) |
