A term rewriting characterization of the polytime functions and related complexity classes. - Arnold Beckmann; Andreas Weiermann (Arch. Math. Log., 1996)

Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. - Arnold Beckmann; Wolfram Pohlers (Ann. Pure Appl. Log., 1998)

Characterizing the elementary recursive functions by a fragment of Gödel's T. - Arnold Beckmann; Andreas Weiermann (Arch. Math. Log., 2000)

Analyzing Gödel's T Via Expanded Head Reduction Trees. - Arnold Beckmann; Andreas Weiermann (Math. Log. Q., 2000)

Exact Bounds for Lengths of Reductions in Typed lambda-Calculus. - Arnold Beckmann (J. Symb. Log., 2001)

Resolution Refutations and Propositional Proofs with Height-Restrictions. - Arnold Beckmann (CSL, 2002)

A Note on Universal Measures for Weak Implicit Computational Complexity. - Arnold Beckmann (LPAR, 2002)

A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. - Arnold Beckmann (Arch. Math. Log., 2002)

Proving Consistency of Equational Theories in Bounded Arithmetic. - Arnold Beckmann (J. Symb. Log., 2002)

Notations for exponentiation. - Arnold Beckmann (Theor. Comput. Sci., 2002)

Dynamic ordinal analysis. - Arnold Beckmann (Arch. Math. Log., 2003)

Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. - Arnold Beckmann; Samuel R. Buss; Chris Pollett (Ann. Pure Appl. Log., 2003)

Ordinal notations and well-orderings in bounded arithmetic. - Arnold Beckmann; Chris Pollett; Samuel R. Buss (Ann. Pure Appl. Log., 2003)

Height restricted constant depth LK - Arnold Beckmann (Electron. Colloquium Comput. Complex., 2003)

Preservation theorems and restricted consistency statements in bounded arithmetic. - Arnold Beckmann (Ann. Pure Appl. Log., 2004)

Preface. - Arnold Beckmann; Jeremy Avigad; Georg Moser (Ann. Pure Appl. Log., 2005)

Separation results for the size of constant-depth propositional proofs. - Arnold Beckmann; Samuel R. Buss (Ann. Pure Appl. Log., 2005)

Uniform Proof Complexity. - Arnold Beckmann (J. Log. Comput., 2005)

An unexpected separation result in Linearly Bounded Arithmetic. - Arnold Beckmann; Jan Johannsen (Math. Log. Q., 2005)

Propositional Logic for Circuit Classes. - Klaus Aehlig; Arnold Beckmann (CSL, 2007)

Proofs, Programs and Abstract Complexity. - Arnold Beckmann (CSL, 2007)

Linear Kripke frames and Gödel logics. - Arnold Beckmann; Norbert Preining (J. Symb. Log., 2007)

Logical Approaches to Computational Barriers: CiE 2006. - Arnold Beckmann; Benedikt Löwe; Dag Normann (J. Log. Comput., 2007)

On the Complexity of Parity Games. - Arnold Beckmann; Faron Moller (BCS Int. Acad. Conf., 2008)

On the Computational Complexity of Cut-Reduction. - Klaus Aehlig; Arnold Beckmann (LICS, 2008)

Computability in Europe 2006. - Arnold Beckmann; Benedikt Löwe (Theory Comput. Syst., 2008)

Continuous Fraïssé Conjecture. - Arnold Beckmann; Martin Goldstern; Norbert Preining (Order, 2008)

From Gödel to Einstein: Computability between logic and physics at CiE 2006. - Arnold Beckmann; Edwin J. Beggs; Benedikt Löwe (Theor. Comput. Sci., 2008)

A Characterisation of Definable NP Search Problems in Peano Arithmetic. - Arnold Beckmann (WoLLIC, 2009)

Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic. - Arnold Beckmann; Samuel R. Buss (J. Math. Log., 2009)

Computability in Europe 2008. - Arnold Beckmann; Costas Dimitracopoulos; Benedikt Löwe (Arch. Math. Log., 2010)

Computability in Europe 2008. - Arnold Beckmann; Benedikt Löwe (Theory Comput. Syst., 2011)

Corrected upper bounds for free-cut elimination. - Arnold Beckmann; Samuel R. Buss (Theor. Comput. Sci., 2011)

Using Domain Specific Languages to Support Verification in the Railway Domain. - Phillip James; Arnold Beckmann; Markus Roggenbach (Haifa Verification Conference, 2012)

Computability in Europe 2009. - Klaus Ambos-Spies; Arnold Beckmann; Samuel R. Buss; Benedikt Löwe (Ann. Pure Appl. Log., 2012)

Computability in Europe 2009. - Arnold Beckmann; Wolfgang Merkle; Benedikt Löwe (Theory Comput. Syst., 2012)

Parity Games and Propositional Proofs. - Arnold Beckmann; Pavel Pudlák; Neil Thapen (MFCS, 2013)

Computability in Europe 2009. - Klaus Ambos-Spies; Arnold Beckmann; Erzsébet Csuhaj-Varjú; Benedikt Löwe (J. Log. Comput., 2013)

Improved witnessing and local improvement principles for second-order bounded arithmetic. - Arnold Beckmann; Samuel R. Buss (ACM Trans. Comput. Log., 2014)

Hyper Natural Deduction. - Arnold Beckmann; Norbert Preining (LICS, 2015)

Safe Recursive Set Functions. - Arnold Beckmann; Samuel R. Buss; Sy-David Friedman (J. Symb. Log., 2015)

Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences. - Arnold Beckmann; Norbert Preining (J. Log. Comput., 2015)

Cobham recursive set functions. - Arnold Beckmann; Sam Buss; Sy-David Friedman; Moritz Müller; Neil Thapen (Ann. Pure Appl. Log., 2016)

Total Search Problems in Bounded Arithmetic and Improved Witnessing. - Arnold Beckmann; Jean-José Razafindrakoto (WoLLIC, 2017)

Deciding logics of linear Kripke frames with scattered end pieces. - Arnold Beckmann; Norbert Preining (Soft Comput., 2017)

The NP Search Problems of Frege and Extended Frege Proofs. - Arnold Beckmann; Sam Buss (ACM Trans. Comput. Log., 2017)

Hyper Natural Deduction for Gödel Logic - A natural deduction system for parallel reasoning. - Arnold Beckmann; Norbert Preining (J. Log. Comput., 2018)

On transformations of constant depth propositional proofs. - Arnold Beckmann; Sam Buss (Ann. Pure Appl. Log., 2019)

Feasible set functions have small circuits. - Arnold Beckmann; Sam Buss; Sy-David Friedman; Moritz Müller; Neil Thapen (Comput., 2019)

Cyber-Physical Trust Systems Driven by Blockchain. - Alexander J. M. Milne; Arnold Beckmann; Pardeep Kumar 001 (IEEE Access, 2020)

Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain. - Arnold Beckmann; João Santos; Indirajith Vijai Ananth (ICFNDS, 2021)

Semantic Asset Administration Shells in Industry 4.0: A Survey. - Sadeer Beden; Qiushi Cao; Arnold Beckmann (ICPS, 2021)

Verification of Bitcoin Script in Agda Using Weakest Preconditions for Access Control. - Fahad F. Alhabardi; Arnold Beckmann; Bogdan Lazar; Anton Setzer (TYPES, 2021)

SCRO: A Domain Ontology for Describing Steel Cold Rolling Processes towards Industry 4.0. - Sadeer Beden; Qiushi Cao; Arnold Beckmann (Inf., 2021)

Data modelling and Remaining Useful Life estimation of rolls in a steel making cold rolling process. - Kayal Lakshmanan; Eugenio Borghini; Arnold Beckmann; Cameron Pleydell-Pearce; Cinzia Giannetti (KES, 2022)

A core reference ontology for steelmaking process knowledge modelling and information management. - Qiushi Cao; Sadeer Beden; Arnold Beckmann (Comput. Ind., 2022)

Verification of Bitcoin's Smart Contracts in Agda using Weakest Preconditions for Access Control. - Fahad F. Alhabardi; Arnold Beckmann; Bogdan Lazar; Anton Setzer (CoRR, 2022)

KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0. - Qiushi Cao; Cecilia Zanni-Merk; Ahmed Samet; Christoph Reich; François de Bertrand de Beuvron; Arnold Beckmann; Cinzia Giannetti (Robotics Comput. Integr. Manuf., 2022)

Towards an Ontological Framework for Integrating Domain Expert Knowledge with Random Forest Classification. - Sadeer Beden; Arnold Beckmann (ICSC, 2023)

On Complexity of Confluence and Church-Rosser Proofs. - Arnold Beckmann; Georg Moser (MFCS, 2024)

InPerpetuity{Challenging Misperceptions of the Term 'Smart Contract'}. - Monica Vessio; Arnold Beckmann; Matt J. Roach; Severine Saintier; Rhys Clements; Anton Setzer (Eur. J. Law Technol., 2024)

On Proving Consistency of Equational Theories in Bounded Arithmetic. - Arnold Beckmann; Yoriyuki Yamagata (J. Symb. Log., 2025)

Access Hoare Logic. - Arnold Beckmann; Anton Setzer (CoRR, 2025)