default search action
Arnold Beckmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Monica Vessio, Arnold Beckmann, Matt J. Roach, Severine Saintier, Rhys Clements, Anton Setzer:
InPerpetuity{Challenging Misperceptions of the Term 'Smart Contract'}. Eur. J. Law Technol. 15(2) (2024) - [c17]Arnold Beckmann, Georg Moser:
On Complexity of Confluence and Church-Rosser Proofs. MFCS 2024: 21:1-21:16 - 2023
- [c16]Sadeer Beden, Arnold Beckmann:
Towards an Ontological Framework for Integrating Domain Expert Knowledge with Random Forest Classification. ICSC 2023: 221-224 - 2022
- [j44]Qiushi Cao, Sadeer Beden, Arnold Beckmann:
A core reference ontology for steelmaking process knowledge modelling and information management. Comput. Ind. 135: 103574 (2022) - [j43]Qiushi Cao
, Cecilia Zanni-Merk, Ahmed Samet
KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0. Robotics Comput. Integr. Manuf. 74: 102281 (2022) - [c15]Kayal Lakshmanan, Eugenio Borghini, Arnold Beckmann, Cameron Pleydell-Pearce, Cinzia Giannetti:
Data modelling and Remaining Useful Life estimation of rolls in a steel making cold rolling process. KES 2022: 1057-1066 - [i5]Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar, Anton Setzer:
Verification of Bitcoin's Smart Contracts in Agda using Weakest Preconditions for Access Control. CoRR abs/2203.03054 (2022) - [i4]Arnold Beckmann, Yoriyuki Yamagata:
On proving consistency of equational theories in Bounded Arithmetic. CoRR abs/2203.04832 (2022) - 2021
- [j42]Sadeer Beden, Qiushi Cao, Arnold Beckmann:
SCRO: A Domain Ontology for Describing Steel Cold Rolling Processes towards Industry 4.0. Inf. 12(8): 304 (2021) - [c14]Arnold Beckmann, João Santos, Indirajith Vijai Ananth:
Modeling and Computing Available Rights for Algorithmic Licensing of Movies based on Blockchain. ICFNDS 2021: 795-802 - [c13]Sadeer Beden, Qiushi Cao, Arnold Beckmann:
Semantic Asset Administration Shells in Industry 4.0: A Survey. ICPS 2021: 31-38 - [c12]Fahad F. Alhabardi
Verification of Bitcoin Script in Agda Using Weakest Preconditions for Access Control. TYPES 2021: 1:1-1:25 - 2020
- [j41]Alexander J. M. Milne, Arnold Beckmann
Cyber-Physical Trust Systems Driven by Blockchain. IEEE Access 8: 66423-66437 (2020)
2010 – 2019
- 2019
- [j40]Arnold Beckmann, Sam Buss:
On transformations of constant depth propositional proofs. Ann. Pure Appl. Log. 170(10): 1176-1187 (2019) - [j39]Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
Feasible set functions have small circuits. Comput. 8(1): 67-98 (2019) - 2018
- [j38]Arnold Beckmann, Norbert Preining:
Hyper Natural Deduction for Gödel Logic - A natural deduction system for parallel reasoning. J. Log. Comput. 28(6): 1125-1187 (2018) - 2017
- [j37]Arnold Beckmann, Norbert Preining:
Deciding logics of linear Kripke frames with scattered end pieces. Soft Comput. 21(1): 191-197 (2017) - [j36]Arnold Beckmann, Sam Buss
The NP Search Problems of Frege and Extended Frege Proofs. ACM Trans. Comput. Log. 18(2): 11:1-11:19 (2017) - [c11]Arnold Beckmann, Jean-José Razafindrakoto:
Total Search Problems in Bounded Arithmetic and Improved Witnessing. WoLLIC 2017: 31-47 - 2016
- [j35]Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
Cobham recursive set functions. Ann. Pure Appl. Log. 167(3): 335-369 (2016) - [e5]Arnold Beckmann, Laurent Bienvenu, Natasa Jonoska:
Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings. Lecture Notes in Computer Science 9709, Springer 2016, ISBN 978-3-319-40188-1 [contents] - 2015
- [j34]Arnold Beckmann, Samuel R. Buss, Sy-David Friedman:
Safe Recursive Set Functions. J. Symb. Log. 80(3): 730-762 (2015) - [j33]Arnold Beckmann
Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences. J. Log. Comput. 25(3): 527-547 (2015) - [c10]Arnold Beckmann, Norbert Preining:
Hyper Natural Deduction. LICS 2015: 547-558 - [e4]Arnold Beckmann, Victor Mitrana
Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings. Lecture Notes in Computer Science 9136, Springer 2015, ISBN 978-3-319-20027-9 [contents] - 2014
- [j32]Arnold Beckmann, Samuel R. Buss:
Improved witnessing and local improvement principles for second-order bounded arithmetic. ACM Trans. Comput. Log. 15(1): 2:1-2:35 (2014) - [j31]Arnold Beckmann
Parity Games and Propositional Proofs. ACM Trans. Comput. Log. 15(2): 17:1-17:30 (2014) - [e3]Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer:
Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings. Lecture Notes in Computer Science 8493, Springer 2014, ISBN 978-3-319-08018-5 [contents] - 2013
- [j30]Klaus Ambos-Spies, Arnold Beckmann, Erzsébet Csuhaj-Varjú, Benedikt Löwe:
Computability in Europe 2009. J. Log. Comput. 23(4): 727-728 (2013) - [c9]Arnold Beckmann, Pavel Pudlák, Neil Thapen:
Parity Games and Propositional Proofs. MFCS 2013: 111-122 - [i3]Pavel Pudlák, Arnold Beckmann, Neil Thapen:
Parity Games and Propositional Proofs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j29]Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe:
Computability in Europe 2009. Ann. Pure Appl. Log. 163(5): 483-484 (2012) - [j28]Arnold Beckmann, Benedikt Löwe:
Computability in Europe 2008. J. Log. Comput. 22(2): 163-164 (2012) - [j27]Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe:
Computability in Europe 2009. Theory Comput. Syst. 51(1): 1-3 (2012) - [c8]Phillip James, Arnold Beckmann, Markus Roggenbach
Using Domain Specific Languages to Support Verification in the Railway Domain. Haifa Verification Conference 2012: 274-275 - 2011
- [j26]Arnold Beckmann, Benedikt Löwe:
Computability in Europe 2008. Theory Comput. Syst. 48(3): 614-616 (2011) - [j25]Arnold Beckmann
Corrected upper bounds for free-cut elimination. Theor. Comput. Sci. 412(39): 5433-5445 (2011) - 2010
- [j24]Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe:
Computability in Europe 2008. Arch. Math. Log. 49(2): 119-121 (2010) - [j23]Klaus Aehlig, Arnold Beckmann
On the computational complexity of cut-reduction. Ann. Pure Appl. Log. 161(6): 711-736 (2010)
2000 – 2009
- 2009
- [j22]Arnold Beckmann
Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic. J. Math. Log. 9(1) (2009) - [c7]Arnold Beckmann:
A Characterisation of Definable NP Search Problems in Peano Arithmetic. WoLLIC 2009: 1-12 - 2008
- [j21]Arnold Beckmann, Benedikt Löwe:
Computability in Europe 2006. Theory Comput. Syst. 43(3-4): 295-297 (2008) - [j20]Arnold Beckmann
Continuous Fraïssé Conjecture. Order 25(4): 281-298 (2008) - [j19]Arnold Beckmann, Edwin J. Beggs, Benedikt Löwe:
From Gödel to Einstein: Computability between logic and physics at CiE 2006. Theor. Comput. Sci. 394(3): 141-143 (2008) - [c6]Arnold Beckmann, Faron Moller:
On the Complexity of Parity Games. BCS Int. Acad. Conf. 2008: 237-248 - [c5]Klaus Aehlig, Arnold Beckmann:
On the Computational Complexity of Cut-Reduction. LICS 2008: 284-293 - [e2]Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe:
Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings. Lecture Notes in Computer Science 5028, Springer 2008, ISBN 978-3-540-69405-2 [contents] - 2007
- [j18]Arnold Beckmann
Linear Kripke frames and Gödel logics. J. Symb. Log. 72(1): 26-44 (2007) - [j17]Arnold Beckmann, Benedikt Löwe, Dag Normann:
Logical Approaches to Computational Barriers: CiE 2006. J. Log. Comput. 17(6): 1021-1023 (2007) - [c4]Arnold Beckmann:
Proofs, Programs and Abstract Complexity. CSL 2007: 4-5 - [c3]Klaus Aehlig, Arnold Beckmann:
Propositional Logic for Circuit Classes. CSL 2007: 512-526 - [i2]Klaus Aehlig, Arnold Beckmann:
On the computational complexity of cut-reduction. CoRR abs/0712.1499 (2007) - 2006
- [e1]Arnold Beckmann, Ulrich Berger
Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings. Lecture Notes in Computer Science 3988, Springer 2006, ISBN 3-540-35466-2 [contents] - 2005
- [j16]Arnold Beckmann, Jeremy Avigad
Preface. Ann. Pure Appl. Log. 136(1-2): 1-2 (2005) - [j15]Arnold Beckmann
Separation results for the size of constant-depth propositional proofs. Ann. Pure Appl. Log. 136(1-2): 30-55 (2005) - [j14]Arnold Beckmann
Uniform Proof Complexity. J. Log. Comput. 15(4): 433-446 (2005) - [j13]Arnold Beckmann
An unexpected separation result in Linearly Bounded Arithmetic. Math. Log. Q. 51(2): 191-200 (2005) - 2004
- [j12]Arnold Beckmann
Preservation theorems and restricted consistency statements in bounded arithmetic. Ann. Pure Appl. Log. 126(1-3): 255-280 (2004) - 2003
- [j11]Arnold Beckmann
Dynamic ordinal analysis. Arch. Math. Log. 42(4): 303-334 (2003) - [j10]Arnold Beckmann
Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Log. 120(1-3): 197-223 (2003) - [j9]Arnold Beckmann, Samuel R. Buss, Chris Pollett:
Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. Ann. Pure Appl. Log. 123(1-3): 291- (2003) - [i1]Arnold Beckmann:
Height restricted constant depth LK. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j8]Arnold Beckmann
A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. Arch. Math. Log. 41(3): 251-257 (2002) - [j7]Arnold Beckmann:
Proving Consistency of Equational Theories in Bounded Arithmetic. J. Symb. Log. 67(1): 279-296 (2002) - [j6]Arnold Beckmann
Notations for exponentiation. Theor. Comput. Sci. 288(1): 3-19 (2002) - [c2]Arnold Beckmann:
Resolution Refutations and Propositional Proofs with Height-Restrictions. CSL 2002: 599-612 - [c1]Arnold Beckmann:
A Note on Universal Measures for Weak Implicit Computational Complexity. LPAR 2002: 53-67 - 2001
- [j5]Arnold Beckmann:
Exact Bounds for Lengths of Reductions in Typed lambda-Calculus. J. Symb. Log. 66(3): 1277-1285 (2001) - 2000
- [j4]Arnold Beckmann
Characterizing the elementary recursive functions by a fragment of Gödel's T. Arch. Math. Log. 39(7): 475-491 (2000) - [j3]Arnold Beckmann, Andreas Weiermann:
Analyzing Gödel's T Via Expanded Head Reduction Trees. Math. Log. Q. 46(4): 517-536 (2000)
1990 – 1999
- 1998
- [j2]Arnold Beckmann
Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. Ann. Pure Appl. Log. 94(1-3): 7-19 (1998) - 1996
- [j1]Arnold Beckmann
A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Log. 36(1): 11-30 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: