Publications

Journal Articles

  1. Beckmann, A., Buss, S. On transformations of constant depth propositional proofs Annals of Pure and Applied Logic
  2. Beckmann, A., Buss, S., Friedman, S., Müller, M., Thapen, N. Feasible set functions have small circuits Computability 8 1 67 98
  3. Beckmann, A., Preining, N. Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning Journal of Logic and Computation 28 6 1125 1187
  4. Beckmann, A., Buss, S. The NP Search Problems of Frege and Extended Frege Proofs ACM Transactions on Computational Logic 18 2 1 19
  5. Beckmann, A., Preining, N. Deciding logics of linear Kripke frames with scattered end pieces Soft Computing 21 1 191 197
  6. Beckmann, A., Buss, S., Friedman, S., Müller, M., Thapen, N. Cobham recursive set functions Annals of Pure and Applied Logic 167 3 335 369
  7. Beckmann, A., Buss, S., Friedman, S. Safe Recursive Set Functions The Journal of Symbolic Logic 80 03 730 762
  8. Beckmann, A., Pudlák, P., Thapen, N. Parity Games and Propositional Proofs ACM Transactions on Computational Logic 15 2 17:1 17:30
  9. Beckmann, A., Preining, N., Beckmann, A. Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences Journal of Logic and Computation
  10. Beckmann, A., Buss, S. Improved witnessing and local improvement principles for second-order bounded arithmetic ACM Transactions on Computational Logic 15 1 2:1 2:35
  11. Beckmann, A., Buss, S. Corrected upper bounds for free-cut elimination Theoretical Computer Science 412 39 5433 5445
  12. Beckmann, A., BUSS, S. POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC Journal of Mathematical Logic 09 01 103 138
  13. Aehlig, K., Beckmann, A. On the computational complexity of cut-reduction Annals of Pure and Applied Logic 161 6 711 736
  14. Beckmann, A., Goldstern, M., Preining, N. Continuous Fraïssé Conjecture Order 25 4 281 298
  15. Beckmann, A., Preining, N. Linear Kripke frames and Gödel logics Journal of Symbolic Logic 72 1 26 44
  16. Beckmann, A. Generalised dynamic ordinals - universal measures for implicit computational complexity Lecture Notes in Logic 27 48 74
  17. Beckmann, A., Beckmann, A. Uniform Proof Complexity Journal of Logic and Computation 15 4 433 446
  18. Beckmann, A., Buss, S. Separation results for the size of constant-depth propositional proofs Annals of Pure and Applied Logic 136 1-2 30 55
  19. Beckmann, A., Johannsen, J. An unexpected separation result in Linearly Bounded Arithmetic MLQ 51 2 191 200
  20. Beckmann, A. Preservation theorems and restricted consistency statements in bounded arithmetic Annals of Pure and Applied Logic 126 1-3 255 280
  21. Beckmann, A., Pollett, C., Buss, S. Ordinal notations and well-orderings in bounded arithmetic Annals of Pure and Applied Logic 120 1-3 197 223
  22. Beckmann, A. Dynamic ordinal analysis Archive for Mathematical Logic 42 4 303 334
  23. Arnold, B., Beckmann, A. Notations for exponentiation Theoretical Computer Science 288 1 3 19
  24. Arnold, B., Beckmann, A. A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets Archive for Mathematical Logic 41 3 251 257
  25. Arnold, B., Andreas, W., Beckmann, A. Characterizing the elementary recursive functions by a fragment of Gödel's T Archive for Mathematical Logic 39 7 475 491
  26. Arnold, B., Andreas, W., Beckmann, A. Analyzing Gödel's T Via Expanded Head Reduction Trees MLQ 46 4 517 536
  27. Arnold, B., Wolfram, P., Beckmann, A. Applications of cut-free infinitary derivations to generalized recursion theory Annals of Pure and Applied Logic 94 1-3 7 19
  28. Arnold, B., Andreas, W., Beckmann, A. A term rewriting characterization of the polytime functions and related complexity classes Archive for Mathematical Logic 36 1 11 30

Books

  1. Beckmann, A., Csuhaj-Varjú, E., Meer, K. Language, Life, Limits (Ed.), Springer
  2. Beckmann, A., Löwe, B. Acts of the Programme Semantics and Syntax (Ed.), College Publication
  3. Beckmann, A. Bounded Arithmetic and Resolution-Based Proof Systems Vienna Kurt Gödel Society

Book Chapters

  1. Beckmann, A., Buss, S., Friedman, S., Müller, M., Thapen, N. Cobham Recursive Set Functions and Weak Set Theories (Ed.), Sets and Computations 55 116 World Scientific
  2. Beckmann, A., Buss, S. Characterising definable search problems in bounded arithmetic via proof notations (Ed.), Ways of Proof Theory 65 134 Berlin De Gruyter

Conference Contributions

  1. Beckmann, A., Razafindrakoto, J., Razafindrakoto, J. Total Search Problems in Bounded Arithmetic and Improved Witnessing Logic, Language, Information, and Computation 10388 31 47
  2. Beckmann, A., Preining, N. Hyper Natural Deduction 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science 547 558
  3. Beckmann, A., Pudlák, P., Thapen, N. Parity Games and Propositional Proofs Mathematical Foundations of Computer Science 2013 8087 111 122
  4. James, P., Beckmann, A., Roggenbach, M. Using Domain Specific Languages to Support Verification in the Railway Domain Hardware and Software: Verification and Testing 7857 274 275
  5. Beckmann, A. A Characterisation of Definable NP Search Problems in Peano Arithmetic Logic, Language, Information and Computation 5514 1 12
  6. Beckmann, A., Moller, F. On the complexity of parity games Visions of Computer Science — BCS International Academic Conference 237 247
  7. Aehlig, K., Beckmann, A. On the Computational Complexity of Cut-Reduction 284 293