Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Arnold Beckmann
2010 – today
- 2012
[j28]Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe: Computability in Europe 2009. Ann. Pure Appl. Logic 163(5): 483-484 (2012)- [j27]
- [j26]Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe: Computability in Europe 2009. Theory Comput. Syst. 51(1): 1-3 (2012)
- 2011
- [j25]Arnold Beckmann, Benedikt Löwe: Computability in Europe 2008. Theory Comput. Syst. 48(3): 614-616 (2011)
- [j24]Arnold Beckmann, Samuel R. Buss: Corrected upper bounds for free-cut elimination. Theor. Comput. Sci. 412(39): 5433-5445 (2011)
- 2010
- [j23]Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe: Computability in Europe 2008. Arch. Math. Log. 49(2): 119-121 (2010)
- [j22]Klaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction. Ann. Pure Appl. Logic 161(6): 711-736 (2010)
2000 – 2009
- 2009
- [c7]Arnold Beckmann: A Characterisation of Definable NP Search Problems in Peano Arithmetic. WoLLIC 2009: 1-12
- 2008
- [j21]Arnold Beckmann, Benedikt Löwe: Computability in Europe 2006. Theory Comput. Syst. 43(3-4): 295-297 (2008)
- [j20]Arnold Beckmann, Martin Goldstern, Norbert Preining: Continuous Fraïssé Conjecture. Order 25(4): 281-298 (2008)
- [j19]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)
- [c6]Arnold Beckmann, Faron Moller: On the Complexity of Parity Games. BCS Int. Acad. Conf. 2008: 237-248
- [c5]
- [e2]Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe (Eds.): Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings. Lecture Notes in Computer Science 5028, Springer 2008, ISBN 978-3-540-69405-2
- 2007
- [j18]Arnold Beckmann, Norbert Preining: Linear Kripke frames and Gödel logics. J. Symb. Log. 72(1): 26-44 (2007)
- [j17]Arnold Beckmann, Benedikt Löwe, Dag Normann: Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. 17(6): 1021-1023 (2007)
- [c4]
- [c3]
- [i2]Klaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction. CoRR abs/0712.1499 (2007)
- 2006
- [e1]Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker (Eds.): Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings. Lecture Notes in Computer Science 3988, Springer 2006, ISBN 3-540-35466-2
- 2005
- [j16]
- [j15]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)
- [j14]
- [j13]Arnold Beckmann, Jan Johannsen: An unexpected separation result in Linearly Bounded Arithmetic. Math. Log. Q. 51(2): 191-200 (2005)
- 2004
- [j12]Arnold Beckmann: Preservation theorems and restricted consistency statements in bounded arithmetic. Ann. Pure Appl. Logic 126(1-3): 255-280 (2004)
- 2003
- [j11]
- [j10]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)
- [j9]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)
- [i1]Arnold Beckmann: Height restricted constant depth LK. Electronic Colloquium on Computational Complexity (ECCC) 10(034) (2003)
- 2002
- [j8]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)
- [j7]Arnold Beckmann: Proving Consistency of Equational Theories in Bounded Arithmetic. J. Symb. Log. 67(1): 279-296 (2002)
- [j6]
- [c2]Arnold Beckmann: Resolution Refutations and Propositional Proofs with Height-Restrictions. CSL 2002: 599-612
- [c1]Arnold Beckmann: A Note on Universal Measures for Weak Implicit Computational Complexity. LPAR 2002: 53-67
- 2001
- [j5]Arnold Beckmann: Exact Bounds for Lengths of Reductions in Typed lambda-Calculus. J. Symb. Log. 66(3): 1277-1285 (2001)
- 2000
- [j4]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)
- [j3]Arnold Beckmann, Andreas Weiermann: Analyzing Gödel's T Via Expanded Head Reduction Trees. Math. Log. Q. 46(4): 517-536 (2000)
1990 – 1999
- 1998
- [j2]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
- [j1]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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:40 CET by the dblp team