The SCEAS System
| |||||||

## Search the dblp DataBase
Arnold Beckmann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Arnold Beckmann
**Resolution Refutations and Propositional Proofs with Height-Restrictions.**[Citation Graph (0, 0)][DBLP] CSL, 2002, pp:599-612 [Conf] - Arnold Beckmann
**A Note on Universal Measures for Weak Implicit Computational Complexity.**[Citation Graph (0, 0)][DBLP] LPAR, 2002, pp:53-67 [Conf] - Arnold Beckmann
**Dynamic ordinal analysis.**[Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2003, v:42, n:4, pp:303-334 [Journal] - Arnold Beckmann
**Preservation theorems and restricted consistency statements in bounded arithmetic.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:255-280 [Journal] - Arnold Beckmann, Jeremy Avigad, Georg Moser
**Preface.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:1-2 [Journal] - Arnold Beckmann, Samuel R. Buss
**Separation results for the size of constant-depth propositional proofs.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:30-55 [Journal] - 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].**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2003, v:123, n:1-3, pp:291-0 [Journal] - Arnold Beckmann, Wolfram Pohlers
**Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:7-19 [Journal] - Arnold Beckmann, Chris Pollett, Samuel R. Buss
**Ordinal notations and well-orderings in bounded arithmetic.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2003, v:120, n:1-3, pp:197-223 [Journal] - Arnold Beckmann
**Height restricted constant depth LK**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:034, pp:- [Journal] - Arnold Beckmann
**Exact Bounds for Lengths of Reductions in Typed lambda-Calculus.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 2001, v:66, n:3, pp:1277-1285 [Journal] - Arnold Beckmann
**Proving Consistency of Equational Theories in Bounded Arithmetic.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 2002, v:67, n:1, pp:279-296 [Journal] - Arnold Beckmann
**Uniform Proof Complexity.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2005, v:15, n:4, pp:433-446 [Journal] - Arnold Beckmann, Andreas Weiermann
**Analyzing Gödel's**[Citation Graph (0, 0)][DBLP]*T*Via Expanded Head Reduction Trees. Math. Log. Q., 2000, v:46, n:4, pp:517-536 [Journal] - Arnold Beckmann, Jan Johannsen
**An unexpected separation result in Linearly Bounded Arithmetic.**[Citation Graph (0, 0)][DBLP] Math. Log. Q., 2005, v:51, n:2, pp:191-200 [Journal] - Arnold Beckmann
**Notations for exponentiation.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:288, n:1, pp:3-19 [Journal] - Klaus Aehlig, Arnold Beckmann
**Propositional Logic for Circuit Classes.**[Citation Graph (0, 0)][DBLP] CSL, 2007, pp:512-526 [Conf] - Arnold Beckmann
**Proofs, Programs and Abstract Complexity.**[Citation Graph (0, 0)][DBLP] CSL, 2007, pp:4-5 [Conf] **On the Computational Complexity of Cut-Reduction.**[Citation Graph (, )][DBLP]**A Characterisation of Definable NP Search Problems in Peano Arithmetic.**[Citation Graph (, )][DBLP]**On the Complexity of Parity Games.**[Citation Graph (, )][DBLP]**A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets.**[Citation Graph (, )][DBLP]**Characterizing the elementary recursive functions by a fragment of Gödel's T.**[Citation Graph (, )][DBLP]**A term rewriting characterization of the polytime functions and related complexity classes.**[Citation Graph (, )][DBLP]**On the computational complexity of cut-reduction.**[Citation Graph (, )][DBLP]**On the computational complexity of cut-reduction**[Citation Graph (, )][DBLP]
Search in 0.039secs, Finished in 0.040secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |