About
Professor Arnold Beckmann is a member of our Computer Science Department at Swansea University.
Personal webpage: https://www.beckmann.pro/
Professor Arnold Beckmann
Professor,
Computer Science
Telephone number
+44 (0) 1792 602370
Research Links
Office - 402
Fourth Floor
Computational Foundry
Bay Campus
Fourth Floor
Computational Foundry
Bay Campus
Available For Postgraduate Supervision
Areas Of Expertise
- Mathematical Logic
- Theoretical Computer Science
- Proof theory and proof complexity
- Bounded arithmetic and propositional proof complexity
- Implicit computational complexity
- Reduction systems
- Intermediate predicate logics
Publications
Research Highlights
-
Alhabardi, F., Beckmann, A., Lazar, B., & Setzer, A. (2022). Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control. In Henning Basold, Jesper Cockx, Silvia Ghilezan (Ed.), 27th International Conference on Types for Proofs and Programs (TYPES 2021) (pp. 1:1-1:25). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
-
Beckmann, A., Santos, J., & Vijai Ananth, I. (2021). Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain. In The 5th International Conference on Future Networks & Distributed Systems (pp. 795-802). ACM.
-
Cao, Q., Beden, S., & Beckmann, A. (2022). A core reference ontology for steelmaking process knowledge modelling and information management. Computers in Industry, 135, 103574
-
Cao, Q., Zanni-Merk, C., Samet, A., Reich, C., Beuvron, F., Beckmann, A., & Giannetti, C. (2022). KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0. Robotics and Computer-Integrated Manufacturing, 74, 102281
-
Milne, A., Beckmann, A., & Kumar, P. (2020). Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access, 8, 66423-66437.
-
Beckmann, A. & Buss, S. (2019). On transformations of constant depth propositional proofs. Annals of Pure and Applied Logic
-
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2018). Feasible set functions have small circuits. Computability, 8(1), 67-98.
-
Beckmann, A. & Preining, N. (2018). Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning. Journal of Logic and Computation, 28(6), 1125-1187.
-
Beckmann, A., Razafindrakoto, J., & Razafindrakoto, J. (2017). Total Search Problems in Bounded Arithmetic and Improved Witnessing. In Logic, Language, Information, and Computation (pp. 31-47). 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings.
-
Beckmann, A. & Buss, S. (2017). The NP Search Problems of Frege and Extended Frege Proofs. ACM Transactions on Computational Logic, 18(2), 1-19.
All Research
Journal Articles
-
Lakshmanan, K., Borghini, E., Beckmann, A., Pleydell-Pearce, C., & Giannetti, C. (2022). Data modelling and Remaining Useful Life estimation of rolls in a steel making cold rolling process. Procedia Computer Science, 207, 1057-1066.
-
Cao, Q., Zanni-Merk, C., Samet, A., Reich, C., Beuvron, F., Beckmann, A., & Giannetti, C. (2022). KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0. Robotics and Computer-Integrated Manufacturing, 74, 102281
-
Cao, Q., Beden, S., & Beckmann, A. (2022). A core reference ontology for steelmaking process knowledge modelling and information management. Computers in Industry, 135, 103574
-
Beden, S., Cao, Q., & Beckmann, A. (2021). SCRO: A Domain Ontology for Describing Steel Cold Rolling Processes towards Industry 4.0. Information, 12(8), 304-18.
-
Milne, A., Beckmann, A., & Kumar, P. (2020). Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access, 8, 66423-66437.
-
Beckmann, A. & Buss, S. (2019). On transformations of constant depth propositional proofs. Annals of Pure and Applied Logic
-
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2018). Feasible set functions have small circuits. Computability, 8(1), 67-98.
-
Beckmann, A. & Preining, N. (2018). Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning. Journal of Logic and Computation, 28(6), 1125-1187.
-
Beckmann, A. & Buss, S. (2017). The NP Search Problems of Frege and Extended Frege Proofs. ACM Transactions on Computational Logic, 18(2), 1-19.
-
Beckmann, A. & Preining, N. (2017). Deciding logics of linear Kripke frames with scattered end pieces. Soft Computing, 21(1), 191-197.
-
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2015). Cobham recursive set functions. Annals of Pure and Applied Logic, 167(3), 335-369.
-
Beckmann, A., Buss, S., & Friedman, S. (2015). Safe Recursive Set Functions. The Journal of Symbolic Logic, 80(03), 730-762.
-
Beckmann, A., Pudlák, P., & Thapen, N. (2014). Parity Games and Propositional Proofs. ACM Transactions on Computational Logic, 15(2), 17:1-17:30.
-
Beckmann, A., Preining, N., & Beckmann, A. (2014). Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences. Journal of Logic and Computation
-
Beckmann, A. & Buss, S. (2014). Improved witnessing and local improvement principles for second-order bounded arithmetic. ACM Transactions on Computational Logic, 15(1), 2:1-2:35.
-
Beckmann, A. & Buss, S. (2011). Corrected upper bounds for free-cut elimination. Theoretical Computer Science, 412(39), 5433-5445.
-
Beckmann, A. & BUSS, S. (2009). POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC. Journal of Mathematical Logic, 09(01), 103-138.
-
Aehlig, K. & Beckmann, A. (2009). On the computational complexity of cut-reduction. Annals of Pure and Applied Logic, 161(6), 711-736.
-
Beckmann, A., Goldstern, M., & Preining, N. (2008). Continuous Fraïssé Conjecture. Order, 25(4), 281-298.
-
Beckmann, A. & Preining, N. (2007). Linear Kripke frames and Gödel logics. Journal of Symbolic Logic, 72(1), 26-44.
-
Beckmann, A. (2006). Generalised dynamic ordinals - universal measures for implicit computational complexity. Lecture Notes in Logic, 27, 48-74.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13719
-
Beckmann, A. & Buss, S. (2005). Separation results for the size of constant-depth propositional proofs. Annals of Pure and Applied Logic, 136(1-2), 30-55.
-
Beckmann, A. & Johannsen, J. (2005). An unexpected separation result in Linearly Bounded Arithmetic. MLQ, 51(2), 191-200.
-
Beckmann, A. & Beckmann, A. (2005). Uniform Proof Complexity. Journal of Logic and Computation, 15(4), 433-446.
-
Beckmann, A. (2004). Preservation theorems and restricted consistency statements in bounded arithmetic. Annals of Pure and Applied Logic, 126(1-3), 255-280.
-
Beckmann, A., Pollett, C., & Buss, S. (2003). Ordinal notations and well-orderings in bounded arithmetic. Annals of Pure and Applied Logic, 120(1-3), 197-223.
-
Beckmann, A. (2002). Dynamic ordinal analysis. Archive for Mathematical Logic, 42(4), 303-334.
-
Arnold, B. & Beckmann, A. (2002). Notations for exponentiation. Theoretical Computer Science, 288(1), 3-19.
-
Arnold, B. & Beckmann, A. (2002). A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. Archive for Mathematical Logic, 41(3), 251-257.
-
Arnold, B., Andreas, W., & Beckmann, A. (2000). Analyzing Gödel's T Via Expanded Head Reduction Trees. MLQ, 46(4), 517-536.
-
Arnold, B., Andreas, W., & Beckmann, A. (2000). Characterizing the elementary recursive functions by a fragment of Gödel's T. Archive for Mathematical Logic, 39(7), 475-491.
-
Arnold, B., Wolfram, P., & Beckmann, A. (1998). Applications of cut-free infinitary derivations to generalized recursion theory. Annals of Pure and Applied Logic, 94(1-3), 7-19.
-
Arnold, B., Andreas, W., & Beckmann, A. (1996). A term rewriting characterization of the polytime functions and related complexity classes. Archive for Mathematical Logic, 36(1), 11-30.
Authored Books
-
Beckmann, A. (2004). Bounded Arithmetic and Resolution-Based Proof Systems Kurt Gödel Society.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa14893
Book Chapters
-
Beckmann, A., Milne, A., Razafindrakoto, J., Kumar, P., Breach, M., & Preining, N. (2020). Blockchain‐Based Cyber Physical Trust Systems. In Madhusanka Liyanage An Braeken Pardeep Kumar Mika Ylianttila (Ed.), IoT Security (pp. 265-277). Wiley
-
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2017). Cobham Recursive Set Functions and Weak Set Theories. Sets and Computations (pp. 55-116). World Scientific
-
Beckmann, A. & Buss, S. (2010). Characterising definable search problems in bounded arithmetic via proof notations. Ways of Proof Theory (pp. 65-134). De Gruyter
Conference Contributions
-
Alhabardi, F., Beckmann, A., Lazar, B., & Setzer, A. (2022). Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control. In Henning Basold, Jesper Cockx, Silvia Ghilezan (Ed.), 27th International Conference on Types for Proofs and Programs (TYPES 2021) (pp. 1:1-1:25). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
-
Beckmann, A., Santos, J., & Vijai Ananth, I. (2021). Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain. In The 5th International Conference on Future Networks & Distributed Systems (pp. 795-802). ACM.
-
Beden, S., Cao, Q., & Beckmann, A. (2021). Semantic Asset Administration Shells in Industry 4.0: A Survey. In 2021 4th IEEE International Conference on Industrial Cyber-Physical Systems (ICPS)IEEE.
-
Beckmann, A., Razafindrakoto, J., & Razafindrakoto, J. (2017). Total Search Problems in Bounded Arithmetic and Improved Witnessing. In Logic, Language, Information, and Computation (pp. 31-47). 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings.
-
Beckmann, A. & Preining, N. (2015). Hyper Natural Deduction. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 547-558). IEEE.
-
James, P., Beckmann, A., & Roggenbach, M. (2013). Using Domain Specific Languages to Support Verification in the Railway Domain. In Hardware and Software: Verification and Testing (pp. 274-275). Springer.
-
Beckmann, A., Pudlák, P., & Thapen, N. (2013). Parity Games and Propositional Proofs. In Mathematical Foundations of Computer Science 2013 (pp. 111-122). Springer.
-
Beckmann, A. (2009). A Characterisation of Definable NP Search Problems in Peano Arithmetic. In Logic, Language, Information and Computation (pp. 1-12). Springer.
-
Beckmann, A. & Moller, F. (2008). On the complexity of parity games. In Visions of Computer Science — BCS International Academic Conference (pp. 237-247). BCS.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa56
-
Aehlig, K. & Beckmann, A. (2008). On the Computational Complexity of Cut-Reduction. (pp. 284-293). IEEE.
Edited Books
-
Beckmann, A., Csuhaj-Varjú, E., & Meer, K. (Eds.). (2014). Language, Life, Limits. Springer.
-
Beckmann, A. & Löwe, B. (Eds.). (2013). Acts of the Programme Semantics and Syntax. College Publication.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa19986
Supervision
-
Untitled (current)
PhDOther supervisor: Prof Cinzia Giannetti -
Combining Blockchain and Semantic Technologies for Addressing Safety and Security Issues in Pharmaceutical Supply Chains (current)
PhDOther supervisor: Dr Anton Setzer -
Verification of Smart contracts using the interactive theorem prover Agda (current)
PhDOther supervisor: Dr Anton Setzer -
Sustainable Digital Frameworks to Support Deployment of Autonomous Analytics in Knowledge Intensive Manufacturing Environments (current)
PhDOther supervisor: Dr Phillip James
Taught Modules
-
CSMM29 Blockchain, Cryptocurrencies and Smart Contracts
This is a module on modern blockchain technology and its major applications. It will give an overview on the technological setup of major cryptocurrencies, and introduce the blockchain as a concept for determining the order of events in a distributed database. In addition, it will discuss the implementation of smart contracts and summarise the current state of the art of security issues in cryptocurrencies, blockchain technology, and smart contracts.