Beckmann, Arnold - Department of Computer Science, University of Wales Swansea

Advanced Search

Beckmann, Arnold - Department of Computer Science, University of Wales Swansea

Ordinal Notations and Well-Orderings in Bounded Arithmetic
On the computational complexity of cut-reduction Klaus Aehlig Arnold Beckmann
Linear Kripke Frames and Godel Logics Arnold Beckmann
Exact bounds for lengths of reductions in typed Arnold Beckmann
Proving consistency of equational theories in bounded arithmetic
Characterizing the elementary recursive functions by a fragment of Godel's T
An Unexpected Separation Result in Linearly Bounded Arithmetic
Generalised Dynamic Ordinals universal measures for implicit computational complexity
Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations
Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic
Continuous Frass Conjecture Arnold Beckmann
Separation results for the size of constant-depth propositional proofs
Dynamic ordinal analysis Arnold Beckmann
A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets
Applications of cutfree infinitary derivations to generalized recursion theory
A note on universal measures for weak implicit computational complexity
Resolution Refutations and Propositional Proofs with Height-Restrictions
Gaisi Takeuti. Incompleteness theorems and Si 2 versus Si+1
Corrected Upper Bounds for Free-Cut Elimination Arnold Beckmann
A Characterisation of Definable NP Search Problems in Peano Arithmetic
Arnold Beckmann Separating fragments
On the complexity of parity games Arnold Beckmann Faron Moller
A term rewriting characterization of the polytime functions and related complexity classes
On the computational complexity of cut-reduction
Notations for Exponentiation Arnold Beckmann 1
Analyzing Godel's T via expanded head reduction trees
Improved Witnessing and Local Improvement Principles for Second-Order Bounded Arithmetic