Professor Arnold Beckmann

Professor, Computer Science

+44 (0) 1792 602370

a.beckmann@swansea.ac.uk

Research Links

https://orcid.org/0000-0001-7958-5790

Office - 402
Fourth Floor
Computational Foundry
Bay Campus

Available For Postgraduate Supervision

About

Professor Arnold Beckmann is a member of our Computer Science Department at Swansea University.

Personal webpage: https://www.beckmann.pro/

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

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.
https://doi.org/10.1145/3508072.3508224, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa59306
http://dx.doi.org/10.1145/3508072.3508224
Cao, Q., Beden, S., & Beckmann, A. (2022). A core reference ontology for steelmaking process knowledge modelling and information management. Computers in Industry, 135, 103574
https://doi.org/10.1016/j.compind.2021.103574, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa59000
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
https://doi.org/10.1016/j.rcim.2021.102281, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58508
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.
https://doi.org/10.3390/info12080304, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa57654
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.
https://doi.org/10.1109/icps49255.2021.9468266, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa56661
Milne, A., Beckmann, A., & Kumar, P. (2020). Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access, 8, 66423-66437.
https://doi.org/10.1109/access.2020.2984675, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa53894
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
https://doi.org/10.1002/9781119527978.ch14, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa52318
Beckmann, A. & Buss, S. (2019). On transformations of constant depth propositional proofs. Annals of Pure and Applied Logic
https://doi.org/10.1016/j.apal.2019.05.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa50215
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2018). Feasible set functions have small circuits. Computability, 8(1), 67-98.
https://doi.org/10.3233/COM-180096, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa40896
https://www.iospress.nl/journal/computability/
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.
https://doi.org/10.1093/logcom/exy019, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa40432

All Research

Journal Articles

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
https://doi.org/10.1016/j.rcim.2021.102281, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58508
Cao, Q., Beden, S., & Beckmann, A. (2022). A core reference ontology for steelmaking process knowledge modelling and information management. Computers in Industry, 135, 103574
https://doi.org/10.1016/j.compind.2021.103574, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa59000
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.
https://doi.org/10.3390/info12080304, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa57654
Milne, A., Beckmann, A., & Kumar, P. (2020). Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access, 8, 66423-66437.
https://doi.org/10.1109/access.2020.2984675, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa53894
Beckmann, A. & Buss, S. (2019). On transformations of constant depth propositional proofs. Annals of Pure and Applied Logic
https://doi.org/10.1016/j.apal.2019.05.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa50215
Beckmann, A., Buss, S., Friedman, S., Müller, M., & Thapen, N. (2018). Feasible set functions have small circuits. Computability, 8(1), 67-98.
https://doi.org/10.3233/COM-180096, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa40896
https://www.iospress.nl/journal/computability/
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.
https://doi.org/10.1093/logcom/exy019, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa40432
Beckmann, A. & Buss, S. (2017). The NP Search Problems of Frege and Extended Frege Proofs. ACM Transactions on Computational Logic, 18(2), 1-19.
https://doi.org/10.1145/3060145, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa32250
http://dx.doi.org/10.1145/3060145
Beckmann, A. & Preining, N. (2017). Deciding logics of linear Kripke frames with scattered end pieces. Soft Computing, 21(1), 191-197.
https://doi.org/10.1007/s00500-016-2400-y, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa30489
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.
https://doi.org/10.1016/j.apal.2015.12.005, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa25296
Beckmann, A., Buss, S., & Friedman, S. (2015). Safe Recursive Set Functions. The Journal of Symbolic Logic, 80(03), 730-762.
https://doi.org/10.1017/jsl.2015.26, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa20591
Beckmann, A., Pudlák, P., & Thapen, N. (2014). Parity Games and Propositional Proofs. ACM Transactions on Computational Logic, 15(2), 17:1-17:30.
https://doi.org/10.1145/2579822, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa17523
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
https://doi.org/10.1093/logcom/exu016, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa17522
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.
https://doi.org/10.1145/2559950, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa14370
Beckmann, A. & Buss, S. (2011). Corrected upper bounds for free-cut elimination. Theoretical Computer Science, 412(39), 5433-5445.
https://doi.org/10.1016/j.tcs.2011.05.053, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7577
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.
https://doi.org/10.1142/S0219061309000847, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa5269
Aehlig, K. & Beckmann, A. (2009). On the computational complexity of cut-reduction. Annals of Pure and Applied Logic, 161(6), 711-736.
https://doi.org/10.1016/j.apal.2009.06.004, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa161
Beckmann, A., Goldstern, M., & Preining, N. (2008). Continuous Fraïssé Conjecture. Order, 25(4), 281-298.
https://doi.org/10.1007/s11083-008-9094-4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa134
Beckmann, A. & Preining, N. (2007). Linear Kripke frames and Gödel logics. Journal of Symbolic Logic, 72(1), 26-44.
https://doi.org/10.2178/jsl/1174668382, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13718
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. & Johannsen, J. (2005). An unexpected separation result in Linearly Bounded Arithmetic. MLQ, 51(2), 191-200.
https://doi.org/10.1002/malq.200410019, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13721
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.
https://doi.org/10.1016/j.apal.2005.05.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13720
Beckmann, A. & Beckmann, A. (2005). Uniform Proof Complexity. Journal of Logic and Computation, 15(4), 433-446.
https://doi.org/10.1093/logcom/exi035, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1702
Beckmann, A. (2004). Preservation theorems and restricted consistency statements in bounded arithmetic. Annals of Pure and Applied Logic, 126(1-3), 255-280.
https://doi.org/10.1016/j.apal.2003.11.003, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13722
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.
https://doi.org/10.1016/S0168-0072(02)00066-0, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13723
Beckmann, A. (2002). Dynamic ordinal analysis. Archive for Mathematical Logic, 42(4), 303-334.
https://doi.org/10.1007/s00153-002-0169-4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1701
Arnold, B. & Beckmann, A. (2002). Notations for exponentiation. Theoretical Computer Science, 288(1), 3-19.
https://doi.org/10.1016/s0304-3975(01)00143-8, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa24553
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.
https://doi.org/10.1007/s001530100107, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa24554
Arnold, B., Andreas, W., & Beckmann, A. (2000). Analyzing Gödel's T Via Expanded Head Reduction Trees. MLQ, 46(4), 517-536.
https://doi.org/10.1002/1521-3870(200010)46:4<517::aid-malq517>3.0.co;2-a, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa24556
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.
https://doi.org/10.1007/s001530050160, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa24555
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.
https://doi.org/10.1016/s0168-0072(97)00063-8, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa24557
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.
https://doi.org/10.1007/s001530050054, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa24558

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
http://kgs.logic.at/index.php?id=9

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
https://doi.org/10.1002/9781119527978.ch14, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa52318
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
https://doi.org/10.1142/9789813223523_0005, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa30495
Beckmann, A. & Buss, S. (2010). Characterising definable search problems in bounded arithmetic via proof notations. Ways of Proof Theory (pp. 65-134). De Gruyter
https://doi.org/10.1515/9783110324907.65, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa8149
http://www.degruyter.com/view/books/9783110324907/9783110324907.65/9783110324907.65.xml
Alhabardi, F., Beckmann, A., Lazar, B., & Setzer, A. (n.d.) Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control. In Henning Basold, Jesper Cockx, Silvia Ghilezan (Ed.), Proceedings of Types 2021 (pp. 1:1-1:27). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa60178

Conference Contributions

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.
https://doi.org/10.1145/3508072.3508224, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa59306
http://dx.doi.org/10.1145/3508072.3508224
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.
https://doi.org/10.1109/icps49255.2021.9468266, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa56661
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.
https://doi.org/10.1007/978-3-662-55386-2_3, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa33863
Beckmann, A. & Preining, N. (2015). Hyper Natural Deduction. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 547-558). IEEE.
https://doi.org/10.1109/LICS.2015.57, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa25297
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.
https://doi.org/10.1007/978-3-642-39611-3_26, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa15231
Beckmann, A., Pudlák, P., & Thapen, N. (2013). Parity Games and Propositional Proofs. In Mathematical Foundations of Computer Science 2013 (pp. 111-122). Springer.
https://doi.org/10.1007/978-3-642-40313-2_12, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa15232
Beckmann, A. (2009). A Characterisation of Definable NP Search Problems in Peano Arithmetic. In Logic, Language, Information and Computation (pp. 1-12). Springer.
https://doi.org/10.1007/978-3-642-02261-6_1, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa54
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.
https://doi.org/10.1109/LICS.2008.9, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa57

Edited Books

Beckmann, A., Csuhaj-Varjú, E., & Meer, K. (Eds.). (2014). Language, Life, Limits. Springer.
https://doi.org/10.1007/978-3-319-08019-2, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa19987
http://link.springer.com/978-3-319-08019-2
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

Combining Blockchain and Semantic Technologies for Addressing Safety and Security Issues in Pharmaceutical Supply Chains (current)

PhD

Other supervisor: Dr Anton Setzer
Verification of Smart contracts using the interactive theorem prover Agda (current)

PhD

Other supervisor: Dr Anton Setzer
Sustainable Digital Frameworks to Support Deployment of Autonomous Analytics in Knowledge Intensive Manufacturing Environments (current)

PhD

Other supervisor: Dr Phillip James

Professor Arnold Beckmann

Telephone number

Email address

LinkedIn Account