About
Dr Arno Pauly is a Lecturer in the department of Computer Science, Swansea University.
Dr Arno Pauly
Senior Lecturer,
Computer Science
Telephone number
+44 (0) 1792 513533
Research Links
Office - 409
Fourth Floor
Computational Foundry
Bay Campus
Fourth Floor
Computational Foundry
Bay Campus
Available For Postgraduate Supervision
Areas Of Expertise
- Computable analysis
- Effective descriptive set theory
- Game theory and CS
Publications
Research Highlights
-
Pauly, A., WESTRICK, L., & YU, L. (2020). LUZIN’S (N) AND RANDOMNESS REFLECTION. The Journal of Symbolic Logic, 87(2), 1-26.
-
GOH, J., Pauly, A., & VALENTI, M. (2021). FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS. The Journal of Symbolic Logic, 86(2), 817-854.
-
KIHARA, T., MARCONE, A., & Pauly, A. (2020). SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE. The Journal of Symbolic Logic, 85(3), 1006-1043.
-
Bruyère, V., Roux, S., Pauly, A., & Raskin, J. (2021). On the existence of weak subgame perfect equilibria. Information and Computation, 276, 104553
-
Brattka, V., Gherardi, G., & Pauly, A. (2021). Weihrauch Complexity in Computable Analysis. Theory and Applications of Computability (pp. 367-417). Springer International Publishing
All Research
Journal Articles
-
GOH, J., Pauly, A., & VALENTI, M. (2021). FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS. The Journal of Symbolic Logic, 86(2), 817-854.
-
Bruyère, V., Roux, S., Pauly, A., & Raskin, J. (2021). On the existence of weak subgame perfect equilibria. Information and Computation, 276, 104553
-
Pauly, A., WESTRICK, L., & YU, L. (2020). LUZIN’S (N) AND RANDOMNESS REFLECTION. The Journal of Symbolic Logic, 87(2), 1-26.
-
KIHARA, T., MARCONE, A., & Pauly, A. (2020). SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE. The Journal of Symbolic Logic, 85(3), 1006-1043.
-
Brecht, M., Pauly, A., & Schröder, M. (2020). Overt choice. Computability, 9(3-4), 169-191.
-
Dzhafarov, D., Goh, J., Hirschfeldt, D., Patey, L., & Pauly, A. (2020). Ramsey’s theorem and products in the Weihrauch degrees. Computability, 9(2), 85-110.
-
Roux, S. & Pauly, A. (2020). Equilibria in multi-player multi-outcome infinite sequential games. Information and Computation, 104557
-
Roux, S. & Pauly, A. (2020). A Semi-Potential for Finite and Infinite Games in Extensive Form. Dynamic Games and Applications, 10(1), 120-144.
-
Gherardi, G., Marcone, A., & Pauly, A. (2019). Projection operators in the Weihrauch lattice. Computability, 8(3-4), 281-304.
-
Davis, C., Hirschfeldt, D., Hirst, J., Pardo, J., Pauly, A., & Yokoyama, K. (2019). Combinatorial principles equivalent to weak induction. Computability, 1-12.
-
Nobrega, H. & Pauly, A. (2019). Game characterizations and lower cones in the Weihrauch degrees. Logical Methods in Computer Science, 15(3), 1-29.
-
Brattka, V., Roux, S., Miller, J., & Pauly, A. (2019). Connected choice and the Brouwer fixed point theorem. Journal of Mathematical Logic, 19(01), 1950004
-
Brattka, V. & Pauly, A. (2018). On the algebraic structure of Weihrauch degrees. Logical Methods in Computer Science, 14(4)
-
Roux, S., Pauly, A., & Raskin, J. (2018). Minkowski Games. ACM Transactions on Computational Logic, 19(3), 1-29.
-
Roux, S. & Pauly, A. (2018). Extending finite-memory determinacy to multi-player games. Information and Computation, 261, 676-694.
-
Hunter, P., Pauly, A., Pérez, G., & Raskin, J. (2018). Mean-payoff games with partial observation. Theoretical Computer Science, 735, 82-110.
-
Pauly, A., Fouche, W., & Davie, G. (2018). Weihrauch-completeness for layerwise computability. Logical Methods in Computer Science, 14(2)
-
Neumann, E., Neumann, E., & Pauly, A. (2018). A topological view on algebraic computation models. Journal of Complexity, 44, 1-22.
-
Pauly, A. & Fouche, W. (2017). How constructive is constructing measures?. Journal of Logic and Analysis, 9
-
Pauly, A. (2017). Many-one reductions and the category of multivalued functions. Mathematical Structures in Computer Science, 27(03), 376-404.
-
Pauly, A. & Steinberg, F. (2017). Comparing Representations for Function Spaces in Computable Analysis. Theory of Computing Systems
-
Le Roux, S. & Pauly, A. (2016). A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). Electronic Proceedings in Theoretical Computer Science, 226, 242-256.
-
Pauly, A. (2016). The Computational Complexity of Iterated Elimination of Dominated Strategies. Theory of Computing Systems, 59(1), 52-75.
-
Le Roux, S. & Pauly, A. (2016). Extending Finite Memory Determinacy to Multiplayer Games. Electronic Proceedings in Theoretical Computer Science, 218, 27-40.
-
GREGORIADES, V., KISPÉTER, T., & Pauly, A. (2016). A comparison of concepts from computable analysis and effective descriptive set theory. Mathematical Structures in Computer Science, 27(08), 1414-1436.
-
Pauly, A. (2016). On the topological aspects of the theory of represented spaces. Computability, 5(2), 159-180.
-
Le Roux, S. & Pauly, A. (2015). Finite choice, convex choice and finding roots. Logical Methods in Computer Science, 11(4)
-
Pauly, A. & de Brecht, M. (2014). Non-deterministic computation and the Jayne-Rogers Theorem. Electronic Proceedings in Theoretical Computer Science, 143, 87-96.
-
Pauly, ., Ziegler, ., & Pauly, A. (2013). Relative computability and uniform continuity of relations. Journal of Logic and Analysis, 1-39.
-
Higuchi, K. & Pauly, A. (2013). THE DEGREE STRUCTURE OF WEIHRAUCH REDUCIBILITY. Logical Methods in Computer Science, 9(2 (02))
-
Brattka, V., de Brecht, M., & Pauly, A. (2012). Closed choice and a Uniform Low Basis Theorem. Annals of Pure and Applied Logic, 163(8), 986-1008.
-
Pauly, A. (2011). How does Universality of coproducts depend on their size?. Topology Proceedings, 37, 177-180.SU Repository: https://cronfa.swan.ac.uk/Record/cronfa37386
-
Brattka, V. & Pauly, A. (2010). Computation with Advice. Electronic Proceedings in Theoretical Computer Science, 24, 41-55.
-
Pauly, A. & Pauly, A. (2010). On the (semi)lattices induced by continuous reducibilities. Mathematical Logic Quarterly, 56(5), 488-502.
-
Pauly, A. & Pauly, A. (2010). How Incomputable is Finding Nash Equilibria?. Journal of Universal Computer Science, 16(18), 2686-2710.
-
Pauly, A. & Pauly, A. (2009). Representing Measurement Results. Journal of Universal Computer Science, 15(6), 1280-1300.
-
Pauly, A. (2008). Flächen aus lauter Nabelpunkten. Elemente der Mathematik, 63SU Repository: https://cronfa.swan.ac.uk/Record/cronfa37389
Book Chapters
-
Brattka, V., Gherardi, G., & Pauly, A. (2021). Weihrauch Complexity in Computable Analysis. Theory and Applications of Computability (pp. 367-417). Springer International Publishing
-
Brattka, V., Gherardi, G., Hoelzl, R., & Pauly, A. (2017). Computability and Complexity. The Vitali Covering Theorem in the Weihrauch Lattice (pp. 188-200).
-
Le Roux, S., Pauly, A., Beckmann, A., Mitrana, V., & Soskova, M. (2015). Evolving Computability. Weihrauch Degrees of Finding Equilibria in Sequential Games (pp. 246-257).
-
Kawamura, A. & Pauly, A. (2014). Language, Life, Limits. Function Spaces for Second-Order Polynomial Time (pp. 245-254). Springer International Publishing
-
Le Roux, S. & Pauly, A. (2013). The Nature of Computation. Logic, Algorithms, Applications. Closed Choice for Finite and for Convex Sets (pp. 294-305). Springer
-
Pauly, A. (2012). Multi-valued Functions in Computability Theory. How the World Computes: Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings (pp. 571-580). SpringerSU Repository: https://cronfa.swan.ac.uk/Record/cronfa37384
-
Pauly, A. (2012). On the Computational Content of the Brouwer Fixed Point Theorem. How the World Computes: Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings (pp. 56-67). Springer
Conference Contributions
-
Pauly, A., Seon, D., & Ziegler, M. (2020). Computing Haar Measures. In Leibniz International Proceedings in Informatics (pp. 34:1-34:17).
-
Kihara, T. & Pauly, A. (2019). Theory and Applications of Models of Computation. (pp. 37815th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019.
-
Hirvonen, Å., Kontinen, J., & Pauly, A. (2019). Continuous Team Semantics. In Theory and Applications of Models of Computation-278). TAMC 2019.
-
Le Roux, S., Pauly, A., & Randour, M. (2018). Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) (pp. 38:1-38:20). FSTTCS.
-
Pauly, A. (2018). Parameterized Games and Parameterized Automata. In Electronic Proceedings in Theoretical Computer Science (pp. 30-42).
-
Brenguier, R., Pauly, A., Raskin, J., & Sankur, O. (2017). Admissibility in Games with Imperfect Information (Invited Talk). In 28th International Conference on Concurrency Theory (CONCUR 2017)Schloss Dagstuhl.
-
Pauly, A. (2017). Minkowski Games. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)Schloss Dagstuhl.
-
Brecht, M. & Pauly, A. (2017). Noetherian Quasi-Polish spaces. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)Schloss Dagstuhl.
-
Nobrega, H. & Pauly, A. (2017). Unveiling Dynamics and Complexity. In Game Characterizations and Lower Cones in the Weihrauch Degrees (pp. 327-337). Springer.
-
Bruyère, V., Roux, S., Pauly, A., & Raskin, J. (2017). Foundations of Software Science and Computation Structures. In On the Existence of Weak Subgame Perfect Equilibria (pp. 145-161). Springer.
-
Pauly, A., Steinberg, F., Kulikov, A., & Woeginger, G. (2016). Representations of Analytic Functions and Weihrauch Degrees. In Computer Science – Theory and Applications. Lecture Notes in Computer Science. (pp. 367-381). 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings.
-
Pauly, A. (2016). Dividing by Zero -- How Bad Is It, Really?. In 41st Int.~Sym.~on Mathematical Foundations of Computer Science (MFCS 2016)Schloss Dagstuhl.
-
Brattka, V., Roux, S., Miller, J., & Pauly, A. (2016). The Brouwer Fixed Point Theorem Revisited. In Pursuit of the Universal (pp. 58-67). Springer International Publishing.
-
Pauly, A. (2015). Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract). In Mathematical Foundations of Computer Science 2015 (pp. 407-418). Springer.
-
Pauly, A. & Brecht, M. (2015). Descriptive Set Theory in the Category of Represented Spaces. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 438-449). IEEE.
-
Jiang, X. & Pauly, A. (2014). Efficient Decomposition of Bimatrix Games (Extended Abstract). In Electronic Proceedings in Theoretical Computer Science (pp. 75-81).
-
Le Roux, S. & Pauly, A. (2014). Infinite sequential games with real-valued payoffs. In CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1-10). ACM.
-
Pauly, A. (2009). How Discontinuous is Computing Nash Equilibria? (Extended Abstract). In 6th International Conference on Computability and Complexity in Analysis (CCA'09)Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
-
Basset, N., Jecker, I., Pauly, A., Raskin, J., & van den Bogaard, M. (n.d.) Beyond Admissibility: Dominance Between Chains of Strategies. Computer Science Logic (CSL).
-
Pauly, A. (n.d.) Enumeration Degrees and Topology. In Sailing Routes in the World of Computation (pp. 228-337).
Supervision
-
Consequences of demanding that agents employ computable strategies (current)
PhDOther supervisor: Prof Jeffrey Giansiracusa -
A SAT solver in Haskell & Agda (current)
MResOther supervisor: Dr Monika Seisenberger -
Deep Encoding: Where Genetic Algorithms and Numeral Systems Meet (awarded 2022)
MResOther supervisor: Dr Ulrich Berger
Taught Modules
-
CS-275 Automata and Formal Language Theory
This module introduces the notion of grammars for defining the syntax of formal languages, especially programming languages. It introduces the limits of computation using Turing Machines and other models of computation.
-
CS-M05 Advanced Topics in logic and computation
This module provides a broad overview of current research. Students will write reports and give talks on general research topics in theoretical computer science.
-
CS-M25 Research Methodology and Project Specification
In this modules students are introduced into the topic, the background and the aims of their project. They write a report on a talk related to their topic, a preliminary and a detailed specification which will be the basis of their research project. Guidance as to appropriate research methodologies in provided.