Arnold Beckmann
Arnold Beckmann
Professor of Computer Science, Swansea University
Bestätigte E-Mail-Adresse bei swansea.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Exact bounds for lengths of reductions in typed λ-calculus
A Beckmann
Journal of Symbolic Logic, 1277-1285, 2001
592001
A term rewriting characterization of the polytime functions and related complexity classes
A Beckmann, A Weiermann
Archive for Mathematical Logic 36 (1), 11-30, 1996
511996
Separating fragments of bounded arithmetic
A Beckmann
Verlag nicht ermittelbar, 1996
351996
Getting a purchase on AR
A Bodhani
Engineering & Technology 8 (4), 46-49, 2013
292013
Dynamic ordinal analysis
A Beckmann
Archive for Mathematical Logic 42 (4), 303-334, 2003
272003
Linear Kripke frames and Gödel logics
A Beckmann, N Preining
Journal of Symbolic Logic, 26-44, 2007
222007
Continuous Fraïssé conjecture
A Beckmann, M Goldstern, N Preining
Order 25 (4), 281, 2008
212008
Characterizing the elementary recursive functions by a fragment of Gödel's T
A Beckmann, A Weiermann
Archive for Mathematical Logic 39 (7), 475-491, 2000
212000
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic
A Beckmann, SR Buss
Journal of Mathematical Logic 9 (01), 103-138, 2009
192009
Separation results for the size of constant-depth propositional proofs
A Beckmann, SR Buss
Annals of Pure and Applied Logic 136 (1), 30-55, 2005
192005
Parity Games and Propositional Proofs
A Beckmann, P Pudlák, N Thapen
ACM Transactions on Computational Logic 15 (2), 17:1 - 17:30, 2014
182014
Improved Witnessing and Local Improvement Principles for Second-Order Bounded Arithmetic
A Beckmann, SR Buss
The Infinity Project 11, 81-114, 2012
182012
Safe recursive set functions
A Beckmann, SR Buss, SD Friedman
The Infinity Project 11, 313-336, 2012
182012
Characterising definable search problems in bounded arithmetic via proof notations
A Beckmann, SR Buss
Ways of proof theory, 65-134, 2013
162013
Applications of cut-free infinitary derivations to generalized recursion theory
A Beckmann, W Pohlers
Annals of pure and applied logic 94 (1-3), 7-19, 1998
161998
Proving consistency of equational theories in bounded arithmetic
A Beckmann
Journal of Symbolic Logic, 279-296, 2002
122002
Ordinal notations and well-orderings in bounded arithmetic
A Beckmann, C Pollett, SR Buss
Annals of Pure and Applied Logic 120 (1-3), 197-223, 2003
112003
Hyper natural deduction
A Beckmann, N Preining
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 547-558, 2015
92015
Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings
A Beckmann, U Berger, B Löwe, JV Tucker
Springer, 2006
92006
Corrected upper bounds for free-cut elimination
A Beckmann, SR Buss
Theoretical Computer Science 412 (39), 5433-5445, 2011
82011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20