%                                                         
% CCA Bibliography on Weihrauch Complexity                
%                                                         
%                                                         
% http://cca-net.de/                                      
%	                                                        
% Last updated on 10 January 2025                              
%	                                                        
% (c) 2015-2025 Vasco Brattka                   
%                                                         

@inproceedings{AAD+22,
   author = {Ackerman, Nathanael and Asilis, Julian and Di, Jieqi and Freer, Cameron and Tristan, Jean-Baptiste},
   title = {Computable {PAC} Learning of Continuous Features},
   booktitle = {Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science},
   series = {LICS '22},
   publisher = {Association for Computing Machinery},
   address = {New York, NY, USA},
   year = {2022},
   doi = {10.1145/3531130.3533330},
}

@phdthesis{AdA20,
   author = {Angl{\`e}s d'Auriac, Paul-Elliot},
   title = {Infinite Computations in Algorithmic Randomness and Reverse Mathematics},
   type = {{Ph.D.} thesis},
   school = {Universit{\'e} Paris-Est},
   year = {2020},
}

@article{ADK21,
   author = {Angl{\`e}s d'Auriac, Paul-Elliot and Kihara, Takayuki},
   title = {A Comparison of Various Analytic Choice Principles},
   journal = {The Journal of Symbolic Logic},
   volume = {86},
   number = {4},
   year = {2021},
   pages = {1452--1485},
   doi = {10.1017/jsl.2021.37},
}

@article{ADSS17,
   author = {Astor, Eric P. and Dzhafarov, Damir D. and Solomon, Reed and Suggs, Jacob},
   title = {The uniform content of partial and linear orders},
   journal = {Annals of Pure and Applied Logic},
   volume = {168},
   number = {6},
   year = {2017},
   pages = {1153 - 1171},
   doi = {10.1016/j.apal.2016.11.010},
}

@article{AFR17,
   author = {Ackerman, Nathanael L. and Freer, Cameron E. and Roy, Daniel M.},
   title = {On computability and disintegration},
   journal = {Mathematical Structures in Computer Science},
   volume = {27},
   number = {8},
   publisher = {Cambridge University Press},
   year = {2017},
   pages = {1287--1314},
   doi = {10.1017/S0960129516000098},
}

@electronic{AH22,
   author = {Amir, Djamel Eddine and Hoyrup, Mathieu},
   title = {Comparing computability in two topologies},
   howpublished = {hal-03702999},
   year = {2022},
}

@electronic{AH22b,
   author = {Amir, Djamel Eddine and Hoyrup, Mathieu},
   title = {Strong computable type},
   howpublished = {arXiv 2210.08309},
   year = {2022},
}

@article{AH23a,
   author = {Amir, Djamel Eddine and Hoyrup, Mathieu},
   title = {Strong computable type},
   journal = {Computability},
   volume = {12},
   number = {3},
   year = {2023},
   pages = {227--269},
   doi = {10.3233/com-220430},
}

@article{AH23b,
   author = {Amir, Djamel Eddine and Hoyrup, Mathieu},
   title = {Strong computable type},
   journal = {Computability},
   volume = {12},
   number = {3},
   year = {2023},
   pages = {227--269},
   doi = {10.3233/COM-220430},
}

@article{AH24,
   author = {Amir, Djamel Eddine and Hoyrup, Mathieu},
   title = {Comparing computability in two topologies},
   journal = {Journal of Symbolic Logic},
   volume = {89},
   number = {3},
   year = {2024},
   pages = {1232--1250},
   doi = {10.1017/jsl.2023.17},
}

@phdthesis{Ami23,
   author = {Amir, Djamel Eddine},
   title = {Computability of Topological Spaces},
   type = {{Ph.D.} thesis},
   school = {Universit{\'{e}} de Lorraine},
   year = {2023},
}

@electronic{Bau21,
   author = {Bauer, Andrej},
   title = {Instance Reducibility and {W}eihrauch Degrees},
   howpublished = {arXiv 2106.01734},
   year = {2021},
}

@article{Bau22,
   author = {Bauer, Andrej},
   title = {Instance reducibility and {W}eihrauch degrees},
   journal = {Logical Methods in Computer Science},
   volume = {18},
   number = {3},
   year = {2022},
   month = Aug,
   pages = {20:1--20:18},
   doi = {10.46298/lmcs-18(3:20)2022},
}

@article{BBP12,
   author = {Brattka, Vasco and de Brecht, Matthew and Pauly, Arno},
   title = {Closed Choice and a Uniform Low Basis Theorem},
   journal = {Annals of Pure and Applied Logic},
   volume = {163},
   year = {2012},
   pages = {986--1008},
   doi = {10.1016/j.apal.2011.12.020},
}

@article{BCG+17,
   author = {Brattka, Vasco and Cettolo, Andrea and Gherardi, Guido and Marcone, Alberto and Schr{\"o}der, Matthias},
   title = {Addendum to: ``{T}he {B}olzano-{W}eierstrass Theorem is the Jump of Weak {K}{\H{o}}nig's Lemma''},
   journal = {Annals of Pure and Applied Logic},
   volume = {168},
   number = {8},
   year = {2017},
   pages = {1605--1608},
   doi = {10.1016/j.apal.2017.04.004},
}

@proceedings{BDMP19,
   title = {{Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)}},
   editor = {Brattka, Vasco and Dzhafarov, Damir D. and Marcone, Alberto and Pauly, Arno},
   series = {Dagstuhl Reports},
   volume = {8},
   number = {9},
   publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
   address = {Dagstuhl, Germany},
   year = {2019},
   pages = {1--28},
   doi = {10.4230/DagRep.8.9.1},
}

@proceedings{BDMP20,
   title = {Special issue: Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018},
   editor = {Brattka, Vasco and Dzhafarov, Damir and Marcone, Alberto and Pauly, Arno},
   series = {Computability - The Journal of the Association CiE},
   volume = {9},
   number = {3, 4},
   publisher = {IOS Press},
   year = {2020},
   pages = {167--341},
   doi = {10.3233/COM-208001},
}

@article{BFLM24,
   author = {Bazhenov, Nikolay and Fiori-Carones, Marta and Liu, Lu and Melnikov, Alexander},
   title = {Primitive recursive reverse mathematics},
   journal = {Annals of Pure and Applied Logic},
   volume = {175},
   number = {1, Part A},
   year = {2024},
   pages = {103354},
   doi = {10.1016/j.apal.2023.103354},
}

@article{BG09,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Borel Complexity of Topological Operations on Computable Metric Spaces},
   journal = {Journal of Logic and Computation},
   volume = {19},
   number = {1},
   year = {2009},
   pages = {45--76},
}

@inproceedings{BG09c,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Weihrauch Degrees, Omniscience Principles and Weak Computability},
   editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I},
   booktitle = {{CCA} 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis},
   publisher = {Leibniz-Zentrum f\"ur Informatik},
   address = {Schloss Dagstuhl, Germany},
   year = {2009},
   pages = {83--94},
}

@inproceedings{BG09d,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Effective Choice and Boundedness Principles in Computable Analysis},
   editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I},
   booktitle = {{CCA} 2009, Proceedings of the Sixth International Conference on Computability and Complexity in Analysis},
   publisher = {Leibniz-Zentrum f\"ur Informatik},
   address = {Schloss Dagstuhl, Germany},
   year = {2009},
   pages = {95--106},
}

@article{BG11,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Weihrauch Degrees, Omniscience Principles and Weak Computability},
   journal = {The Journal of Symbolic Logic},
   volume = {76},
   number = {1},
   year = {2011},
   pages = {143--176},
   doi = {10.2178/jsl/1294170993},
}

@article{BG11a,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Effective Choice and Boundedness Principles in Computable Analysis},
   journal = {The Bulletin of Symbolic Logic},
   volume = {17},
   number = {1},
   year = {2011},
   pages = {73--117},
   doi = {10.2178/bsl/1294186663},
}

@electronic{BG18,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Weihrauch Goes {B}rouwerian},
   howpublished = {arXiv 1809.00380},
   year = {2018},
}

@electronic{BG19,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Completion of Choice},
   howpublished = {arXiv 1910.13186},
   year = {2019},
}

@article{BG20,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Weihrauch Goes {B}rouwerian},
   journal = {The Journal of Symbolic Logic},
   volume = {85},
   number = {4},
   year = {2020},
   pages = {1614--1653},
   doi = {10.1017/jsl.2020.76},
}

@article{BG21a,
   author = {Brattka, Vasco and Gherardi, Guido},
   title = {Completion of Choice},
   journal = {Annals of Pure and Applied Logic},
   volume = {172},
   number = {3},
   year = {2021},
   pages = {102914},
   doi = {10.1016/j.apal.2020.102914},
}

@inproceedings{BGH15,
   author = {Brattka, Vasco and Gherardi, Guido and H{\"o}lzl, Rupert},
   title = {Las {V}egas Computability and Algorithmic Randomness},
   editor = {Mayr, Ernst W. and Ollinger, Nicolas},
   booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science ({STACS} 2015)},
   series = {Leibniz International Proceedings in Informatics ({LIPI}cs)},
   volume = {30},
   publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
   address = {Dagstuhl, Germany},
   year = {2015},
   pages = {130--142},
   doi = {10.4230/LIPIcs.STACS.2015.130},
}

@article{BGH15a,
   author = {Brattka, Vasco and Gherardi, Guido and H{\"o}lzl, Rupert},
   title = {Probabilistic Computability and Choice},
   journal = {Information and Computation},
   volume = {242},
   year = {2015},
   pages = {249--286},
   doi = {10.1016/j.ic.2015.03.005},
}

@incollection{BGHP17,
   author = {Brattka, Vasco and Gherardi, Guido and H\"olzl, Rupert and Pauly, Arno},
   title = {The {V}itali Covering Theorem in the {W}eihrauch Lattice},
   editor = {Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances},
   booktitle = {Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday},
   series = {Lecture Notes in Computer Science},
   volume = {10010},
   publisher = {Springer},
   address = {Cham},
   year = {2017},
   pages = {188--200},
   doi = {10.1007/978-3-319-50062-1_14},
}

@proceedings{BGKS22,
   title = {Special issue: Oberwolfach Workshop on Computability Theory 2021},
   editor = {Brattka, Vasco and Greenberg, Noam and Kalimullin, Iskander and Soskova, Mariya},
   series = {Computability - The Journal of the Association CiE},
   volume = {11},
   number = {3, 4},
   publisher = {IOS Press},
   year = {2022},
   pages = {163--358},
   doi = {10.3233/COM-220950},
}

@article{BGM12,
   author = {Brattka, Vasco and Gherardi, Guido and Marcone, Alberto},
   title = {The {B}olzano-{W}eierstrass Theorem is the Jump of Weak {K}{\H{o}}nig's Lemma},
   journal = {Annals of Pure and Applied Logic},
   volume = {163},
   year = {2012},
   pages = {623--655},
   doi = {10.1016/j.apal.2011.10.006},
}

@electronic{BGP17,
   author = {Brattka, Vasco and Gherardi, Guido and Pauly, Arno},
   title = {Weihrauch Complexity in Computable Analysis},
   howpublished = {arXiv 1707.03202},
   year = {2017},
}

@incollection{BGP21,
   author = {Brattka, Vasco and Gherardi, Guido and Pauly, Arno},
   title = {Weihrauch Complexity in Computable Analysis},
   editor = {Brattka, Vasco and Hertling, Peter},
   booktitle = {Handbook of Computability and Complexity in Analysis},
   series = {Theory and Applications of Computability},
   publisher = {Springer},
   address = {Cham},
   year = {2021},
   pages = {367--417},
   doi = {10.1007/978-3-030-59234-9\_11},
}

@proceedings{BH21,
   title = {Handbook of Computability and Complexity in Analysis},
   editor = {Brattka, Vasco and Hertling, Peter},
   series = {Theory and Applications of Computability},
   publisher = {Springer},
   address = {Cham},
   year = {2021},
   doi = {10.1007/978-3-030-59234-9},
}

@inproceedings{BHK17,
   author = {Brattka, Vasco and H{\"o}lzl, Rupert and Kuyper, Rutger},
   title = {{M}onte {C}arlo Computability},
   editor = {Vollmer, Heribert and Vall{\'e}e, Brigitte},
   booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
   series = {Leibniz International Proceedings in Informatics (LIPIcs)},
   volume = {66},
   publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
   address = {Dagstuhl, Germany},
   year = {2017},
   pages = {17:1--17:14},
   doi = {10.4230/LIPIcs.STACS.2017.17},
}

@article{BHK17a,
   author = {Brattka, Vasco and Hendtlass, Matthew and Kreuzer, Alexander P.},
   title = {On the Uniform Computational Content of Computability Theory},
   journal = {Theory of Computing Systems},
   volume = {61},
   number = {4},
   year = {2017},
   pages = {1376--1426},
   doi = {10.1007/s00224-017-9798-1},
}

@article{BHK18,
   author = {Brattka, Vasco and Hendtlass, Matthew and Kreuzer, Alexander P.},
   title = {On the Uniform Computational Content of the {B}aire Category Theorem},
   journal = {Notre Dame Journal of Formal Logic},
   volume = {59},
   number = {4},
   year = {2018},
   pages = {605--636},
   doi = {10.1215/00294527-2018-0016},
}

@electronic{BHW21,
   author = {BeMent, Zack and Hirst, Jeffry and Wallace, Asuka},
   title = {Reverse mathematics and {W}eihrauch analysis motivated by finite complexity theory},
   howpublished = {arXiv 2105.01719},
   year = {2021},
}

@article{BHW21a,
   author = {BeMent, Zach and Hirst, Jeffry and Wallace, Asuka},
   title = {Reverse mathematics and {W}eihrauch analysis motivated by finite complexity theory},
   journal = {Computability},
   volume = {10},
   number = {4},
   year = {2021},
   pages = {343--354},
   doi = {10.3233/COM-210310},
}

@incollection{BK17,
   author = {Bienvenu, Laurent and Kuyper, Rutger},
   title = {Parallel and serial jumps of {W}eak {W}eak {K}{\"o}nig's {L}emma},
   editor = {Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances},
   booktitle = {Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday},
   series = {Lecture Notes in Computer Science},
   volume = {10010},
   publisher = {Springer},
   address = {Cham},
   year = {2017},
   pages = {201--217},
   doi = {10.1007/978-3-319-50062-1_15},
}

@proceedings{BKM+16,
   title = {{Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis (Dagstuhl Seminar 15392)}},
   editor = {Brattka, Vasco and Kawamura, Akitoshi and Marcone, Alberto and Pauly, Arno},
   series = {Dagstuhl Reports},
   volume = {5},
   number = {9},
   publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
   address = {Dagstuhl, Germany},
   year = {2016},
   pages = {77--104},
   doi = {10.4230/DagRep.5.9.77},
}

@inproceedings{BLP12a,
   author = {Brattka, Vasco and Le Roux, St{\'e}phane and Pauly, Arno},
   title = {On the Computational Content of the {B}rouwer {F}ixed {P}oint {T}heorem},
   editor = {Cooper, S. Barry and Dawar, Anuj and L{\"o}we, Benedikt},
   booktitle = {How the World Computes},
   series = {Lecture Notes in Computer Science},
   volume = {7318},
   publisher = {Springer},
   address = {Berlin},
   year = {2012},
   pages = {57--67},
   note = {Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 2012},
   doi = {10.1007/978-3-642-30870-3_7},
}

@inproceedings{BLRMP16,
   author = {Brattka, Vasco and Le Roux, St{\'e}phane and Miller, Joseph S. and Pauly, Arno},
   title = {The {B}rouwer Fixed Point Theorem Revisited},
   editor = {Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nata\v{s}a},
   booktitle = {Pursuit of the Universal},
   series = {Lecture Notes in Computer Science},
   volume = {9709},
   publisher = {Springer},
   address = {Switzerland},
   year = {2016},
   pages = {58--67},
   note = {12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016},
   doi = {10.1007/978-3-319-40189-8_6},
}

@article{BLRMP19,
   author = {Brattka, Vasco and Le Roux, St{\'e}phane and Miller, Joseph S. and Pauly, Arno},
   title = {Connected Choice and the {B}rouwer Fixed Point Theorem},
   journal = {Journal of Mathematical Logic},
   volume = {19},
   number = {1},
   year = {2019},
   pages = {1--46},
   doi = {10.1142/S0219061319500041},
}

@inproceedings{BP10,
   author = {Brattka, Vasco and Pauly, Arno},
   title = {Computation with Advice},
   editor = {Zheng, Xizhong and Zhong, Ning},
   booktitle = {{CCA} 2010, Proceedings of the Seventh International Conference on Computability and Complexity in Analysis},
   series = {Electronic Proceedings in Theoretical Computer Science},
   volume = {24},
   year = {2010},
   pages = {41--55},
}

@article{BP18,
   author = {Brattka, Vasco and Pauly, Arno},
   title = {On the Algebraic Structure of {W}eihrauch Degrees},
   journal = {Logical Methods in Computer Science},
   volume = {14},
   number = {4:4},
   year = {2018},
   pages = {1--36},
   doi = {10.23638/LMCS-14(4:4)2018},
}

@inproceedings{BP19a,
   author = {Boche, H. and Pohl, V.},
   title = {The Solvability Complexity Index of Sampling-based {H}ilbert Transform Approximations},
   booktitle = {2019 13th International conference on Sampling Theory and Applications (SampTA)},
   year = {2019},
   pages = {1--4},
   doi = {10.1109/SampTA45681.2019.9030934},
}

@article{BPS20,
   author = {Brecht, Matthew de and Pauly, Arno and Schr\"{o}der, Matthias},
   title = {Overt choice},
   journal = {Computability},
   volume = {9},
   number = {3-4},
   year = {2020},
   pages = {169--191},
   doi = {10.3233/com-190253},
}

@article{BR17,
   author = {Brattka, Vasco and Rakotoniaina, Tahina},
   title = {On the Uniform Computational Content of {R}amsey's Theorem},
   journal = {Journal of Symbolic Logic},
   volume = {82},
   number = {4},
   year = {2017},
   pages = {1278--1316},
   doi = {10.1017/jsl.2017.43},
}

@article{Bra05,
   author = {Brattka, Vasco},
   title = {Effective {B}orel measurability and reducibility of functions},
   journal = {Mathematical Logic Quarterly},
   volume = {51},
   number = {1},
   year = {2005},
   pages = {19--44},
}

@inproceedings{Bra16,
   author = {Brattka, Vasco},
   title = {Computability and Analysis, a Historical Approach},
   editor = {Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nata\v{s}a},
   booktitle = {Pursuit of the Universal},
   series = {Lecture Notes in Computer Science},
   volume = {9709},
   publisher = {Springer},
   address = {Switzerland},
   year = {2016},
   pages = {45--57},
   note = {12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016},
   doi = {10.1007/978-3-319-40189-8_5},
}

@electronic{Bra20,
   author = {Brattka, Vasco},
   title = {The Discontinuity Problem},
   howpublished = {arXiv 2012.02143},
   year = {2020},
}

@article{Bra21,
   author = {Brattka, Vasco},
   title = {Stashing-Parallelization Pentagons},
   journal = {Logical Methods in Computer Science},
   howpublished = {arXiv 2102.11832},
   volume = {17},
   number = {4},
   year = {2021},
   pages = {20:1-20:29},
   doi = {10.46298/LMCS-17(4:20)2021},
}

@incollection{Bra22a,
   author = {Brattka, Vasco},
   title = {Weihrauch complexity and the {H}agen school of computable analysis},
   editor = {L{\"o}we, Benedikt and Sarikaya, Deniz},
   booktitle = {60 {J}ahre {DVMLG}},
   series = {Tributes},
   volume = {48},
   publisher = {College Publications},
   address = {London},
   year = {2022},
   pages = {13--44},
}

@article{Bra23,
   author = {Brattka, Vasco},
   title = {The Discontinuity Problem},
   journal = {Journal of Symbolic Logic},
   volume = {88},
   number = {3},
   year = {2023},
   pages = {1191--1212},
   doi = {10.1017/jsl.2021.106},
}

@inproceedings{Bra23a,
   author = {Brattka, Vasco},
   title = {On the complexity of learning programs},
   editor = {Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin},
   booktitle = {Unity of Logic and Computation},
   series = {Lecture Notes in Computer Science},
   volume = {13967},
   publisher = {Springer},
   address = {Cham},
   year = {2023},
   pages = {166--177},
   note = {19th Conference on Computability in Europe},
   doi = {10.1007/978-3-031-36978-0$\_$14},
}

@electronic{Bra23b,
   author = {Brattka, Vasco},
   title = {On the complexity of computing {G}{\"o}del numbers},
   howpublished = {arXiv 2302.04213},
   year = {2023},
}

@inproceedings{Bra97a,
   author = {Brattka, Vasco},
   title = {Computable Invariance},
   editor = {Jiang, Tao and Lee, D.T.},
   booktitle = {Computing and Combinatorics},
   series = {Lecture Notes in Computer Science},
   volume = {1276},
   publisher = {Springer},
   address = {Berlin},
   year = {1997},
   pages = {146--155},
   note = {Third Annual Conference, COCOON'97, Shanghai, China, August 1997},
}

@article{Bra99,
   author = {Brattka, Vasco},
   title = {Computable invariance},
   journal = {Theoretical Computer Science},
   volume = {210},
   year = {1999},
   pages = {3--20},
}

@electronic{BS24,
   author = {Brattka, Vasco and Smischliaew, Hendrik},
   title = {Computability of Initial Value Problems},
   howpublished = {arXiv arXiv:2501.00451},
   year = {2024},
}

@phdthesis{Car13,
   author = {Carroy, Rapha{\"e}l},
   title = {Functions of the first {B}aire class},
   school = {University of Lausanne and University Paris 7},
   year = {2013},
}

@article{Car13a,
   author = {Carroy, Rapha{\"e}l},
   title = {A quasi-order on continuous functions},
   journal = {Journal of Symbolic Logic},
   volume = {78},
   number = {2},
   year = {2013},
   pages = {663--648},
   doi = {10.2178/jsl.7802150},
}

@electronic{Car16,
   author = {Carl, Merlin},
   title = {Generalized Effective Reducibility},
   howpublished = {arXiv 1601.01899},
   year = {2016},
}

@inproceedings{Car16a,
   author = {Carl, Merlin},
   title = {Generalized Effective Reducibility},
   editor = {Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nata\v{s}a},
   booktitle = {Pursuit of the Universal},
   series = {Lecture Notes in Computer Science},
   volume = {9709},
   publisher = {Springer},
   address = {Switzerland},
   year = {2016},
   pages = {225--233},
   note = {12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016},
   doi = {10.1007/978-3-319-40189-8_23},
}

@book{Car19,
   author = {Carl, Merlin},
   title = {Ordinal Computability, An Introduction to Infinitary Machines},
   volume = {9},
   publisher = {de Gruyter},
   address = {Berlin},
   year = {2019},
}

@article{Car21,
   author = {Carl, Merlin},
   title = {Effectivity and reducibility with ordinal {T}uring machines},
   journal = {Computability},
   volume = {10},
   number = {4},
   year = {2021},
   pages = {289--304},
   doi = {10.3233/COM-210307},
}

@article{CDHP20,
   author = {Cholak, Peter A. and Dzhafarov, Damir D. and Hirschfeldt, Denis R. and Patey, Ludovic},
   title = {Some results concerning the {$\rm SRT^2_2$} vs. {COH} problem},
   journal = {Computability},
   volume = {9},
   number = {3-4},
   year = {2020},
   pages = {193--217},
   doi = {10.3233/COM-190251},
}

@phdthesis{Cip23,
   author = {Cipriani, Vittorio},
   title = {Many Problems, Different Frameworks, Classification of Problems in Computable Analysis and Algorithmic Learning Theory},
   type = {{Ph.D.} thesis},
   school = {Universit{\'a} degli Studi di Udine},
   year = {2023},
}

@electronic{CMV22,
   author = {Cipriani, Vittorio and Marcone, Alberto and Valenti, Manlio},
   title = {The Weihrauch lattice at the level of $\Pi^1_1$-{CA}$_0$: the {C}antor-{B}endixson theorem},
   howpublished = {arXiv 2210.15556},
   year = {2022},
}

@inproceedings{CP23a,
   author = {Cipriani, Vittorio and Pauly, Arno},
   title = {The Complexity of Finding Supergraphs},
   editor = {Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin},
   booktitle = {Unity of Logic and Computation},
   series = {Lecture Notes in Computer Science},
   volume = {13967},
   publisher = {Springer},
   address = {Cham},
   year = {2023},
   pages = {178--189},
   note = {19th Conference on Computability in Europe},
   doi = {10.1007/978-3-031-36978-0\_$15},
}

@electronic{CP24,
   author = {Carroy, Rapha\"{e}l and Pequignot, Yann},
   title = {A well-quasi-order for continuous functions},
   howpublished = {arXiv 2410.13150v1},
   year = {2024},
}

@incollection{dBre14,
   author = {de Brecht, Matthew},
   title = {Levels of Discontinuity, Limit-Computability, and Jump Operators},
   editor = {Brattka, Vasco and Diener, Hannes and Spreen, Dieter},
   booktitle = {Logic, Computation, Hierarchies},
   series = {Ontos Mathematical Logic},
   publisher = {Walter de Gruyter},
   address = {Boston},
   year = {2014},
   pages = {93--122},
}

@article{DDH+16,
   author = {Dorais, Fran\c{c}ois G. and Dzhafarov, Damir D. and Hirst, Jeffry L. and Mileti, Joseph R. and Shafer, Paul},
   title = {On uniform relationships between combinatorial problems},
   journal = {Transactions of the American Mathematical Society},
   volume = {368},
   number = {2},
   year = {2016},
   pages = {1321--1359},
   doi = {10.1090/tran/6465},
}

@article{DDW22,
   author = {Day, Adam R. and Downey, Rod and Westrick, Linda},
   title = {Three topological reducibilities for discontinuous functions},
   journal = {Transactions of the American Mathematical Society. Series B},
   volume = {9},
   year = {2022},
   pages = {859--895},
   doi = {10.1090/btran/115},
}

@electronic{DFSW17,
   author = {Dzhafarov, Damir and Flood, Stephen and Solomon, Reed and Westrick, Linda Brown},
   title = {Effectiveness for the Dual {R}amsey Theorem},
   howpublished = {arXiv 1710.00070},
   year = {2017},
}

@electronic{DGH+18,
   author = {Dzhafarov, Damir D. and Goh, Jun Le and Hirschfeldt, Denis R. and Patey, Ludovic and Pauly, Arno},
   title = {{R}amsey's theorem and products in the {W}eihrauch degrees},
   howpublished = {arXiv 1804.10968},
   year = {2018},
}

@article{DGH+20,
   author = {Dzhafarov, Damir D. and Goh, Jun Le and Hirschfeldt, Denis R. and Patey, Ludovic and Pauly, Arno},
   title = {Ramsey's theorem and products in the {W}eihrauch degrees},
   journal = {Computability},
   volume = {9},
   number = {2},
   year = {2020},
   pages = {85--110},
   doi = {10.3233/com-180203},
}

@electronic{DHH+18,
   author = {Davis, Caleb and Hirschfeldt, Denis R. and Hirst, Jeffry L. and Pardo, Jake and Pauly, Arno and Yokoyama, Keita},
   title = {Combinatorial principles equivalent to weak induction},
   howpublished = {arXiv 1812.09943},
   year = {2018},
}

@article{DHH+20,
   author = {Davis, Caleb and Hirschfeldt, Denis R. and Hirst, Jeffry and Pardo, Jake and Pauly, Arno and Yokoyama, Keita},
   title = {Combinatorial principles equivalent to weak induction},
   journal = {Computability},
   volume = {9},
   number = {3-4},
   year = {2020},
   pages = {219--229},
   doi = {10.3233/com-180244},
}

@electronic{DHR20,
   author = {Dzhafarov, Damir D. and Hirschfeldt, Denis R. and Reitzes, Sarah C.},
   title = {Reduction Games, Provability, and Compactness},
   howpublished = {arXiv 2008.00907},
   year = {2020},
}

@article{DHR22,
   author = {Dzhafarov, Damir D. and Hirschfeldt, Denis R. and Reitzes, Sarah C.},
   title = {Reduction Games, Provability, and Compactness},
   journal = {Journal of Mathematical Logic},
   volume = {22},
   number = {3},
   year = {2022},
   pages = {2250009},
   doi = {10.1142/S021906132250009X},
}

@book{DM22,
   author = {Dzhafarov, Damir D. and Mummert, Carl},
   title = {Reverse Mathematics},
   series = {Theory and Applications of Computability},
   publisher = {Springer},
   year = {2022},
   doi = {10.1007/978-3-031-11367-3},
}

@electronic{DMN20,
   author = {Rod Downey and Alexander Melnikov and Keng Meng Ng},
   title = {Foundations of Online Structure Theory {II}: The Operator Approach},
   howpublished = {arXiv 2007.07401},
   year = {2020},
}

@article{DP21,
   author = {Dzhafarov, Damir D. and Patey, Ludovic},
   title = {{COH}, {SRT22}, and multiple functionals},
   journal = {Computability},
   volume = {10},
   number = {2},
   year = {2021},
   pages = {111--121},
   doi = {10.3233/COM-190261},
}

@article{DPSW17,
   author = {Dzhafarov, Damir D. and Patey, Ludovic and Solomon, Reed and Westrick, Linda Brown},
   title = {Ramsey's theorem for singletons and strong computable reducibility},
   journal = {Proceedings of the American Mathematical Society},
   volume = {145},
   year = {2017},
   doi = {10.1090/proc/13315},
}

@electronic{DSV23,
   author = {Dzhafarov, Damir and Solomon, Reed and Valenti, Manlio},
   title = {The tree pigeonhole principle in the {W}eihrauch degrees},
   howpublished = {arXiv 2312.10535},
   year = {2023},
}

@electronic{DSY23,
   author = {Dzhafarov, Damir D. and Solomon, Reed and Yokoyama, Keita},
   title = {On the first-order parts of problems in the {W}eihrauch degrees},
   howpublished = {arXiv 2301.12733},
   year = {2023},
}

@article{DSY24,
   author = {Dzhafarov, Damir and Solomon, Reed and Yokoyama, Keita},
   title = {On the first-order parts of problems in the {W}eihrauch degrees},
   journal = {Computability},
   volume = {13},
   number = {3--4},
   year = {2024},
   pages = {363--375},
   doi = {10.3233/COM-230446},
}

@article{Dzh15,
   author = {Dzhafarov, Damir D.},
   title = {Cohesive avoidance and strong reductions},
   journal = {Proceedings of the American Mathematical Society},
   volume = {143},
   number = {2},
   year = {2015},
   pages = {869--876},
   doi = {10.1090/S0002-9939-2014-12261-1},
}

@article{Dzh16,
   author = {Dzhafarov, Damir D.},
   title = {Strong reductions between combinatorial principles},
   journal = {Journal of Symbolic Logic},
   volume = {81},
   number = {4},
   year = {2016},
   pages = {1405-1431},
   doi = {10.1017/jsl.2016.1},
}

@article{Dzh19,
   author = {Dzhafarov, Damir D.},
   title = {Joins in the strong {W}eihrauch degrees},
   journal = {Mathematical Research Letters},
   volume = {26},
   number = {3},
   year = {2019},
   pages = {749--767},
   doi = {10.4310/MRL.2019.v26.n3.a5},
}

@article{FHK14,
   author = {Fujiwara, Makoto and Higuchi, Kojiro and Kihara, Takayuki},
   title = {On the strength of marriage theorems and uniformity},
   journal = {Mathematical Logic Quarterly},
   volume = {60},
   number = {3},
   year = {2014},
   pages = {136--153},
   doi = {10.1002/malq.201300021},
}

@article{FJLM22,
   author = {Flood, Stephen and Jura, Matthew and Levin, Oscar and Markkanen, Tyler},
   title = {The computational strength of matchings in countable graphs},
   journal = {Annals of Pure and Applied Logic},
   volume = {173},
   number = {8},
   year = {2022},
   pages = {Paper No. 103133, 26},
   doi = {10.1016/j.apal.2022.103133},
}

@article{FM21,
   author = {Fiori-Carones, Marta and Marcone, Alberto},
   title = {To reorient is easier than to orient: an on-line algorithm for reorientation of graphs},
   journal = {Computability},
   volume = {10},
   number = {3},
   year = {2021},
   pages = {215--233},
   doi = {10.3233/com-190285},
}

@electronic{FSS20,
   author = {Fiori-Carones, Marta and Shafer, Paul and Sold{\`a}, Giovanni},
   title = {An inside/outside {R}amsey theorem and recursion theory},
   howpublished = {arXiv 2006.16969},
   year = {2020},
}

@article{FSS22,
   author = {Fiori-Carones, Marta and Shafer, Paul and Sold{\`a}, Giovanni},
   title = {An inside/outside {R}amsey theorem and recursion theory},
   journal = {Transactions of the American Mathematical Society},
   volume = {375},
   number = {3},
   year = {2022},
   pages = {1977--2024},
   doi = {10.1090/tran/8561},
}

@inproceedings{Fuj20,
   author = {Fujiwara, Makoto},
   title = {Parallelizations in {W}eihrauch Reducibility and Constructive Reverse Mathematics},
   editor = {Anselmo, Marcella and Della Vedova, Gianluca and Manea, Florin and Pauly, Arno},
   booktitle = {Beyond the Horizon of Computability},
   publisher = {Springer International Publishing},
   address = {Cham},
   year = {2020},
   pages = {38--49},
   doi = {10.1007/978-3-030-51466-2_4},
}

@article{Fuj21,
   author = {Fujiwara, Makoto},
   title = {Weihrauch and constructive reducibility between existence statements},
   journal = {Computability},
   volume = {10},
   number = {1},
   year = {2021},
   doi = {10.3233/COM-190278},
}

@inproceedings{Ghe06,
   author = {Gherardi, Guido},
   title = {An Analysis of the Lemmas of {U}rysohn and {U}rysohn-{T}ietze According to Effective {B}orel Measurability},
   editor = {Beckmann, A. and Berger, U. and L{\"o}we, B. and Tucker, J.V.},
   booktitle = {Logical Approaches to Computational Barriers},
   series = {Lecture Notes in Computer Science},
   volume = {3988},
   publisher = {Springer},
   address = {Berlin},
   year = {2006},
   pages = {199--208},
   note = {Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006},
}

@article{Ghe06a,
   author = {Gherardi, Guido},
   title = {Effective {B}orel degrees of some topological functions},
   journal = {Mathematical Logic Quarterly},
   volume = {52},
   number = {6},
   year = {2006},
   pages = {625--642},
}

@phdthesis{Ghe06b,
   author = {Gherardi, Guido},
   title = {Some Results in Computable Analysis and Effective {B}orel Measurability},
   school = {University of Siena, Department of Mathematics and Computer Science},
   address = {Siena},
   year = {2006},
}

@article{GHM15,
   author = {Gura, Kirill and Hirst, Jeffry L. and Mummert, Carl},
   title = {On the existence of a connected component of a graph},
   journal = {Computability},
   volume = {4},
   number = {2},
   year = {2015},
   pages = {103--117},
   doi = {10.3233/COM-150039},
}

@electronic{Gil23a,
   author = {Gill, Kenneth},
   title = {Indivisibility and uniform computational strength},
   howpublished = {arXiv 2312.03919},
   year = {2023},
}

@article{GKT19,
   author = {Greenberg, Noam and Kuyper, Rutger and Turetsky, Dan},
   title = {Cardinal invariants, non-lowness classes, and {W}eihrauch reducibility},
   journal = {Computability},
   volume = {8},
   number = {3, 4},
   year = {2019},
   pages = {305--346},
   doi = {10.3233/COM-180219},
}

@inproceedings{GM08,
   author = {Gherardi, Guido and Marcone, Alberto},
   title = {How Incomputable is the Separable {H}ahn-{B}anach Theorem?},
   editor = {Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch, Angela},
   booktitle = {{CCA} 2008, Fifth International Conference on Computability and Complexity in Analysis},
   series = {Electronic Notes in Theoretical Computer Science},
   volume = {221},
   publisher = {Elsevier},
   year = {2008},
   pages = {85--102},
   note = {{CCA} 2008, Fifth International Conference, Hagen, Germany, August 21--24, 2008},
}

@article{GM09,
   author = {Gherardi, Guido and Marcone, Alberto},
   title = {How Incomputable is the Separable {H}ahn-{B}anach Theorem?},
   journal = {Notre Dame Journal of Formal Logic},
   volume = {50},
   number = {4},
   year = {2009},
   pages = {393--425},
   doi = {10.1215/00294527-2009-018},
}

@article{GMN21,
   author = {Greenberg, Noam and Miller, Joseph S. and Nies, An},
   title = {Highness properties close to {PA} completeness},
   journal = {Israel Journal of Mathematics},
   volume = {244},
   year = {2021},
   pages = {419--465},
   doi = {10.1007/s11856-021-2200-7},
}

@electronic{GMP18,
   author = {Gherardi, Guido and Marcone, Alberto and Pauly, Arno},
   title = {Projection operators in the {W}eihrauch lattice},
   howpublished = {arXiv 1805.12026},
   year = {2018},
}

@article{GMP19,
   author = {Gherardi, Guido and Marcone, Alberto and Pauly, Arno},
   title = {Projection operators in the {W}eihrauch lattice},
   journal = {Computability},
   volume = {8},
   number = {3, 4},
   year = {2019},
   pages = {281--304},
   doi = {10.3233/COM-180207},
}

@inproceedings{GN17,
   author = {Galeotti, Lorenzo and Nobrega, Hugo},
   title = {Towards Computable Analysis on the Generalized Real Line},
   editor = {Kari, Jarkko and Manea, Florin and Petre, Ion},
   booktitle = {Unveiling Dynamics and Complexity},
   series = {Lecture Notes in Computer Science},
   volume = {10307},
   publisher = {Springer},
   address = {Cham},
   year = {2017},
   pages = {246--257},
   note = {13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017},
   doi = {10.1007/978-3-319-58741-7_24},
}

@electronic{Goh19,
   author = {Goh, Jun Le},
   title = {Some computability-theoretic reductions between principles around {ATR}$_0$},
   howpublished = {arXiv 1905.06868},
   year = {2019},
}

@phdthesis{Goh19a,
   author = {Goh, Jun Le},
   title = {Measuring the Relative Complexity of Mathematical Constructions and Theorems},
   type = {{Ph.D.} thesis},
   school = {Cornell University},
   year = {2019},
   month = {August},
   doi = {10.7298/0h3c-x173},
}

@article{Goh20,
   author = {Goh, Jun Le},
   title = {Compositions of multivalued functions},
   journal = {Computability},
   volume = {9},
   number = {3-4},
   year = {2020},
   pages = {231--247},
   doi = {10.3233/com-180235},
}

@article{Goh20a,
   author = {Goh, Jun Le},
   title = {Embeddings between well-orderings: Computability-theoretic reductions},
   journal = {Annals of Pure and Applied Logic},
   volume = {171},
   number = {6},
   year = {2020},
   pages = {102789},
   doi = {10.1016/j.apal.2020.102789},
}

@electronic{GPV20,
   author = {Goh, Jun Le and Pauly, Arno and Valenti, Manlio},
   title = {Finding descending sequences through ill-founded linear orders},
   howpublished = {arXiv 2010.03840},
   year = {2020},
}

@article{GPV21,
   author = {Goh, Jun Le and Pauly, Arno and Valenti, Manlio},
   title = {Finding descending sequences through ill-founded linear orders},
   journal = {The Journal of Symbolic Logic},
   volume = {86},
   number = {2},
   year = {2021},
   pages = {817--854},
   doi = {10.1017/jsl.2021.15},
}

@electronic{GPV24,
   author = {Goh, Jun Le and Pauly, Arno and Valenti, Manlio},
   title = {The weakness of finding descending sequences in ill-founded linear orders},
   howpublished = {arXiv 2401.11807},
   year = {2024},
   doi = {arXiv.2401.11807},
}

@inproceedings{GPV24a,
   author = {Goh, Jun Le and Pauly, Arno and Valenti, Manlio},
   title = {The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders},
   editor = {Levy Patey, Ludovic and Pimentel, Elaine and Galeotti, Lorenzo and Manea, Florin},
   booktitle = {Twenty Years of Theoretical and Practical Synergies},
   publisher = {Springer Nature Switzerland},
   address = {Cham},
   year = {2024},
   pages = {339--350},
}

@article{Her20,
   author = {Hertling, Peter},
   title = {Forests describing {W}adge degrees and topological {W}eihrauch degrees of certain classes of functions and relations},
   journal = {Computability},
   volume = {9},
   number = {3-4},
   year = {2020},
   pages = {249--307},
   doi = {10.3233/com-190255},
}

@techreport{Her93,
   author = {Hertling, Peter},
   title = {Topologische {K}omplexit\"atsgrade von {F}unktionen mit endlichem {B}ild},
   type = {Informatik Berichte},
   number = {152},
   institution = {FernUniversit\"at Hagen},
   address = {Hagen},
   year = {1993},
   month = dec,
}

@techreport{Her93a,
   author = {Hertling, Peter},
   title = {Stetige {R}eduzierbarkeit auf {$\Sigma^\omega$} von {F}unktionen mit zweielementigem {B}ild und von zweistetigen {F}unktionen mit diskretem {B}ild},
   type = {Informatik Berichte},
   number = {153},
   institution = {FernUniversit\"at Hagen},
   address = {Hagen},
   year = {1993},
   month = dec,
}

@techreport{Her93b,
   author = {Hertling, Peter},
   title = {A topological complexity hierarchy of functions with finite range},
   number = {223},
   institution = {Centre de recerca matematica, Institut d'estudis catalans, Barcelona},
   address = {Barcelona},
   year = {1993},
   month = oct,
   note = {Workshop on Continuous Algorithms and Complexity, Barcelona, October, 1993},
}

@phdthesis{Her96d,
   author = {Hertling, Peter},
   title = {{U}nstetigkeitsgrade von {F}unktionen in der effektiven {A}nalysis},
   school = {Fachbereich Informatik},
   address = {FernUniversit\"{a}t Hagen},
   year = {1996},
   note = {{D}issertation},
}

@phdthesis{Hig12a,
   author = {Higuchi, Kojiro},
   title = {Degree Structures of Mass Problems and Choice Functions},
   school = {Mathematical Institute, Tohoku University},
   address = {Sendai, Japan},
   year = {2012},
   month = {January},
}

@book{Hir15,
   author = {Hirschfeldt, Denis R.},
   title = {Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles},
   series = {Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore},
   volume = {28},
   publisher = {World Scientific},
   address = {Singapore},
   year = {2015},
}

@incollection{Hir17,
   author = {Hirschfeldt, Denis R.},
   title = {Some Questions in Computable Mathematics},
   editor = {Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances},
   booktitle = {Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday},
   series = {Lecture Notes in Computer Science},
   volume = {10010},
   publisher = {Springer},
   address = {Cham},
   year = {2017},
   pages = {22--55},
   doi = {10.1007/978-3-319-50062-1_4},
}

@electronic{Hir18,
   author = {Hirst, Jeffry L.},
   title = {Leaf management},
   howpublished = {arXiv 1812.09762},
   year = {2018},
}

@article{Hir20,
   author = {Hirst, Jeffry L.},
   title = {Leaf management},
   journal = {Computability},
   volume = {9},
   number = {3-4},
   year = {2020},
   pages = {309--314},
   doi = {10.3233/com-180243},
}

@article{HJ16,
   author = {Hirschfeldt, Denis R. and Jockusch, Carl G.},
   title = {On notions of computability-theoretic reduction between {$\Pi_2^1$} principles},
   journal = {Journal of Mathematical Logic},
   volume = {16},
   number = {1},
   year = {2016},
   pages = {1650002, 59},
   doi = {10.1142/S0219061316500021},
}

@article{HK14,
   author = {Higuchi, Kojiro and Kihara, Takayuki},
   title = {Inside the {M}uchnik degrees {I}: Discontinuity, learnability and constructivism},
   journal = {Annals of Pure and Applied Logic},
   volume = {165},
   number = {5},
   year = {2014},
   pages = {1058--1114},
   doi = {10.1016/j.apal.2014.01.003},
}

@article{HK14a,
   author = {Higuchi, Kojiro and Kihara, Takayuki},
   title = {Inside the {M}uchnik Degrees {II}: The degree structures induced by the arithmetical hierarchy of countably continuous functions},
   journal = {Annals of Pure and Applied Logic},
   volume = {165},
   number = {6},
   year = {2014},
   pages = {1201--1241},
   doi = {10.1016/j.apal.2014.03.001},
}

@incollection{HM17,
   author = {Hirst, Jeffry L. and Mummert, Carl},
   title = {Reverse Mathematics of Matroids},
   editor = {Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov, Bakhadyr and Melnikov, Alexander and Rosamond, Frances},
   booktitle = {Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday},
   series = {Lecture Notes in Computer Science},
   volume = {10010},
   publisher = {Springer},
   address = {Cham},
   year = {2017},
   pages = {143--159},
   doi = {10.1007/978-3-319-50062-1_12},
}

@article{HM19,
   author = {Hirst, Jeffry L. and Mummert, Carl},
   title = {Using {R}amsey's theorem once},
   journal = {Archive for Mathematical Logic},
   volume = {58},
   number = {7-8},
   year = {2019},
   pages = {857--866},
   doi = {10.1007/s00153-019-00664-z},
}

@article{HM23,
   author = {Hirst, Jeffry L. and Mummert, Carl},
   title = {Banach’s theorem in higher-order reverse mathematics},
   journal = {Computability},
   volume = {12},
   number = {3},
   year = {2023},
   pages = {203--225},
   doi = {10.3233/COM-230453},
}

@article{Hoy17,
   author = {Hoyrup, Mathieu},
   title = {Genericity of Weakly Computable Objects},
   journal = {Theory of Computing Systems},
   volume = {60},
   number = {3},
   year = {2017},
   pages = {396--420},
   doi = {10.1007/s00224-016-9737-6},
}

@phdthesis{Hoy23,
   author = {Hoyrup, Mathieu},
   title = {Topological Aspects of Representations in Computable Analysis},
   school = {Laboratoire Lorrain de Recherche en Informatique et ses Applications},
   address = {Nancy, France},
   year = {2023},
   note = {Habilitation Thesis},
}

@article{Hoy23a,
   author = {Hoyrup, Mathieu},
   title = {Notes on overt choice},
   journal = {Computability},
   volume = {12},
   number = {4},
   year = {2023},
   pages = {351--369},
   doi = {10.3233/COM-230458},
}

@article{HP13,
   author = {Higuchi, Kojiro and Pauly, Arno},
   title = {The degree structure of {W}eihrauch reducibility},
   journal = {Log. Methods Comput. Sci.},
   volume = {9},
   number = {2},
   year = {2013},
   pages = {2:02, 17},
   doi = {10.2168/LMCS-9(2:2)2013},
}

@inproceedings{HRW11,
   author = {Hoyrup, Mathieu and Rojas, Crist{\'o}bal and Weihrauch, Klaus},
   title = {Computability of the {R}adon-{N}ikodym derivative},
   editor = {L{\"o}we, Benedikt and Normann, Dag and Soskov, Ivan and Soskova, Alexandra},
   booktitle = {Models of Computation in Context},
   series = {Lecture Notes in Computer Science},
   volume = {6735},
   publisher = {Springer},
   address = {Heidelberg},
   year = {2011},
   pages = {132--141},
   doi = {10.1007/978-3-642-21875-0_14},
}

@article{HRW12,
   author = {Hoyrup, Mathieu and Rojas, Crist{\'o}bal and Weihrauch, Klaus},
   title = {Computability of the {R}adon-{N}ikodym Derivative},
   journal = {Computability},
   volume = {1},
   number = {1},
   year = {2012},
   pages = {3--13},
   doi = {10.3233/COM-2012-005},
}

@inproceedings{HS11,
   author = {Hertling, Peter and Selivanov, Victor},
   title = {Complexity issues for preorders on finite labeled forests},
   editor = {L{\"o}we, Benedikt and Normann, Dag and Soskov, Ivan and Soskova, Alexandra},
   booktitle = {Models of computation in context},
   series = {Lecture Notes in Computer Science},
   volume = {6735},
   publisher = {Springer},
   address = {Heidelberg},
   year = {2011},
   pages = {112--121},
   note = {7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27--July 2, 2011},
   doi = {10.1007/978-3-642-21875-0_12},
}

@incollection{HS14a,
   author = {Hertling, Peter and Selivanov, Victor},
   title = {Complexity issues for preorders on finite labeled forests},
   editor = {Brattka, Vasco and Diener, Hannes and Spreen, Dieter},
   booktitle = {Logic, Computation, Hierarchies},
   series = {Ontos Mathematical Logic},
   publisher = {Walter de Gruyter},
   address = {Boston},
   year = {2014},
   pages = {165--190},
}

@article{HS15,
   author = {H{\"o}lzl, Rupert and Shafer, Paul},
   title = {Universality, optimality, and randomness deficiency},
   journal = {Annals of Pure and Applied Logic},
   volume = {166},
   number = {10},
   year = {2015},
   pages = {1049--1069},
   doi = {j.apal.2015.05.006},
}

@phdthesis{Hug21,
   author = {Hughes, Noah A.},
   title = {Applications of Computability Theory to Infinitary Combinatorics},
   type = {{Ph.D.} thesis},
   school = {University of Connecticut},
   year = {2021},
}

@inproceedings{HW94,
   author = {Hertling, Peter and Weihrauch, Klaus},
   title = {Levels of degeneracy and exact lower complexity bounds for geometric algorithms},
   booktitle = {Proceedings of the Sixth Canadian Conference on Computational Geometry},
   year = {1994},
   pages = {237--242},
   note = {{S}askatoon, Saskatchewan, August 2--6, 1994},
}

@techreport{HW94a,
   author = {Hertling, Peter and Weihrauch, Klaus},
   title = {On the topological classification of degeneracies},
   type = {Informatik Berichte},
   number = {154},
   institution = {FernUniversit\"at Hagen},
   address = {Hagen},
   year = {1994},
   month = feb,
}

@inproceedings{Kaw09a,
   author = {Kawamura, Akitoshi},
   title = {Lipschitz continuous ordinary differential equations are polynomial-space complete},
   booktitle = {24th {A}nnual {IEEE} {C}onference on {C}omputational {C}omplexity},
   publisher = {IEEE Computer Soc., Los Alamitos, CA},
   year = {2009},
   pages = {149--160},
   doi = {10.1109/CCC.2009.34},
}

@article{Kaw10,
   author = {Kawamura, Akitoshi},
   title = {{L}ipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete},
   journal = {Computational Complexity},
   volume = {19},
   number = {2},
   year = {2010},
   pages = {305--332},
   doi = {10.1007/s00037-010-0286-0},
}

@inproceedings{KC10,
   author = {Kawamura, Akitoshi and Cook, Stephen},
   title = {Complexity theory for operators in analysis},
   booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing},
   series = {STOC '10},
   publisher = {ACM},
   address = {New York},
   year = {2010},
   pages = {495--502},
   doi = {10.1145/1806689.1806758},
}

@article{Kih16,
   author = {Kihara, Takayuki},
   title = {{B}orel-piecewise continuous reducibility for uniformization problems},
   journal = {Logical Methods in Computer Science},
   volume = {12},
   number = {4},
   year = {2016},
   month = Oct,
   doi = {10.2168/LMCS-12(4:4)2016},
}

@electronic{Kih20,
   author = {Kihara, Takayuki},
   title = {Degrees of Incomputability, Realizability and Constructive Reverse Mathematics},
   howpublished = {arXiv 2002.10712},
   year = {2020},
}

@electronic{Kih21,
   author = {Kihara, Takayuki},
   title = {Lawvere-{T}ierney Topologies for Computability Theorists},
   howpublished = {arXiv 2106.03061},
   year = {2021},
}

@article{Kih22,
   author = {Kihara, Takayuki},
   title = {Topological reducibilities for discontinuous functions and their structures},
   journal = {Israel Journal of Mathematics},
   year = {2022},
   doi = {10.1007/s11856-022-2367-6},
}

@article{Kih23,
   author = {Kihara, Takayuki},
   title = {Lawvere-{T}ierney Topologies for Computability Theorists},
   journal = {Transactions of the American Mathematical Society, Series B},
   volume = {10},
   number = {2},
   year = {2023},
   pages = {48--85},
   doi = {10.1090/btran/134},
}

@electronic{KMP18,
   author = {Kihara, Takayuki and Marcone, Alberto and Pauly, Arno},
   title = {Searching for an analogue of {ATR} in the {W}eihrauch lattice},
   howpublished = {arXiv 1812.01549},
   year = {2018},
}

@article{KMP20,
   author = {Kihara, Takayuki and Marcone, Alberto and Pauly, Arno},
   title = {Searching for an analogue of {$ATR_0$} in the {W}eihrauch lattice},
   journal = {Journal of Symbolic Logic},
   volume = {85},
   number = {3},
   year = {2020},
   pages = {1006--1043},
   doi = {10.1017/jsl.2020.12},
}

@inproceedings{KO14,
   author = {Kawamura, Akitoshi and Ota, Hiroyuki},
   title = {Small complexity classes for computable analysis},
   booktitle = {Mathematical foundations of computer science 2014. {P}art {II}},
   series = {Lecture Notes in Comput. Sci.},
   volume = {8635},
   publisher = {Springer, Heidelberg},
   year = {2014},
   pages = {432--444},
   doi = {10.1007/978-3-662-44465-8_37},
}

@article{Koh19,
   author = {Kohlenbach, Ulrich},
   title = {On the reverse mathematics and {W}eihrauch complexity of moduli of regularity and uniqueness},
   journal = {Computability},
   volume = {8},
   number = {3, 4},
   year = {2019},
   pages = {377--387},
   doi = {10.3233/COM-180097},
}

@inproceedings{KORZ12,
   author = {Kawamura, Akitoshi and Ota, Hiroyuki and R{\"o}snick, Carsten and Ziegler, Martin},
   title = {Computational complexity of smooth differential equations},
   booktitle = {Mathematical foundations of computer science 2012},
   series = {Lecture Notes in Comput. Sci.},
   volume = {7464},
   publisher = {Springer, Heidelberg},
   year = {2012},
   pages = {578--589},
   doi = {10.1007/978-3-642-32589-2_51},
}

@article{KORZ14,
   author = {Kawamura, Akitoshi and Ota, Hiroyuki and R{\"o}snick, Carsten and Ziegler, Martin},
   title = {Computational Complexity of Smooth Differential Equations},
   journal = {Logical Methods in Computer Science},
   volume = {10},
   year = {2014},
   pages = {1:6,15},
   doi = {10.2168/LMCS-10(1:6)2014},
}

@inproceedings{KP14a,
   author = {Kawamura, Akitoshi and Pauly, Arno},
   title = {Function spaces for second-order polynomial time},
   booktitle = {Language, life, limits},
   series = {Lecture Notes in Comput. Sci.},
   volume = {8493},
   publisher = {Springer, Cham},
   year = {2014},
   pages = {245--254},
   doi = {10.1007/978-3-319-08019-2_25},
}

@inproceedings{KP16a,
   author = {Kihara, Takayuki and Pauly, Arno},
   title = {Dividing by Zero - How Bad Is It, Really?},
   editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
   booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
   series = {Leibniz International Proceedings in Informatics (LIPIcs)},
   volume = {58},
   publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
   address = {Dagstuhl, Germany},
   year = {2016},
   pages = {58:1--58:14},
   doi = {10.4230/LIPIcs.MFCS.2016.58},
}

@incollection{KP16b,
   author = {Kihara, Takayuki and Pauly, Arno},
   title = {Dividing by zero---how bad is it, really?},
   booktitle = {41st {I}nternational {S}ymposium on {M}athematical {F}oundations of {C}omputer {S}cience},
   series = {LIPIcs. Leibniz Int. Proc. Inform.},
   volume = {58},
   publisher = {Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern},
   year = {2016},
   pages = {Art. No. 58, 14},
   doi = {10.4230/LIPIcs.MFCS.2016.58},
}

@incollection{KP19,
   author = {Kihara, Takayuki and Pauly, Arno},
   title = {Finite choice, convex choice and sorting},
   editor = {Gopal, T.V. and Watada, Junzo},
   booktitle = {Theory and applications of models of computation},
   series = {Lecture Notes in Computer Science},
   volume = {11436},
   publisher = {Springer},
   address = {Cham},
   year = {2019},
   pages = {378--393},
   note = {15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13--16, 2019},
   doi = {10.1007/978-3-030-14812-6_23},
}

@article{Kre12,
   author = {Kreuzer, Alexander P.},
   title = {On the Strength of Weak Compactness},
   journal = {Computability},
   volume = {1},
   number = {2},
   year = {2012},
   pages = {171--179},
   doi = {10.3233/COM-12010},
}

@article{Kre14,
   author = {Kreuzer, Alexander P.},
   title = {From {B}olzano-{W}eierstra\ss\ to {A}rzel\`a-{A}scoli},
   journal = {Mathematical Logic Quarterly},
   volume = {60},
   number = {3},
   year = {2014},
   pages = {177--183},
   doi = {10.1002/malq.201200076},
}

@article{Kre14a,
   author = {Kreuzer, Alexander P.},
   title = {Bounded variation and the strength of {H}elly's selection theorem},
   journal = {Logical Methods in Computer Science},
   volume = {10},
   number = {4:16},
   year = {2014},
   pages = {1--23},
   doi = {10.2168/LMCS-10(4:16)2014},
}

@inproceedings{KSZ10,
   author = {Kudinov, Oleg V. and Selivanov, Victor L. and Zhukov, Anton V.},
   title = {Undecidability in {W}eihrauch Degrees},
   editor = {Ferreira, Fernando and L{\"o}we, Benedikt and Mayordomo, Elvira and Mendes Gomes, Lu{\'i}s},
   booktitle = {Programs, Proofs, Processes},
   series = {Lecture Notes in Computer Science},
   volume = {6158},
   publisher = {Springer},
   address = {Berlin},
   year = {2010},
   pages = {256--265},
   note = {6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June/July 2010},
}

@article{Kuy17,
   author = {Kuyper, Rutger},
   title = {On {W}eihrauch reducibility and intuitionistic reverse mathematics},
   journal = {Journal of Symbolic Logic},
   volume = {82},
   number = {4},
   year = {2017},
   pages = {1438--1458},
   doi = {10.1017/jsl.2016.61},
}

@electronic{Li24,
   author = {Li, Ang},
   title = {Countable Ordered Groups and {W}eihrauch Reducibility},
   howpublished = {arXiv 2409.19229},
   year = {2024},
}

@electronic{LMP+23,
   author = {Lempp, Steffen and Miller, Joseph S. and Pauly, Arno and Soskova, Mariya I. and Valenti, Manlio},
   title = {Minimal covers in the {W}eihrauch degrees},
   howpublished = {arXiv 2311.12676},
   year = {2023},
}

@article{LMP+24,
   author = {Lempp, Steffen and Miller, Joseph S. and Pauly, Arno and Soskova, Mariya I. and Valenti, Manlio},
   title = {Minimal covers in the {W}eihrauch degrees},
   journal = {Proceedings of the American Mathematical Society},
   volume = {152},
   number = {11},
   year = {2024},
   pages = {4893--4901},
   doi = {10.1090/proc/16952},
}

@inproceedings{LP13,
   author = {Le Roux, St{\'e}phane and Pauly, Arno},
   title = {Closed Choice for Finite and for Convex Sets},
   editor = {Bonizzoni, Paola and Brattka, Vasco and L{\"o}we, Benedikt},
   booktitle = {The Nature of Computation. Logic, Algorithms, Applications},
   series = {Lecture Notes in Computer Science},
   volume = {7921},
   publisher = {Springer},
   address = {Berlin},
   year = {2013},
   pages = {294--305},
   note = {9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013},
   doi = {10.1007/978-3-642-39053-1_34},
}

@inproceedings{LRP15,
   author = {Le Roux, St{\'e}phane and Pauly, Arno},
   title = {Weihrauch Degrees of Finding Equilibria in Sequential Games (Extended Abstract)},
   editor = {Beckmann, Arnold and Mitrana, Victor and Soskova, Mariya},
   booktitle = {Evolving Computability},
   series = {Lecture Notes in Computer Science},
   volume = {9136},
   publisher = {Springer},
   address = {Cham},
   year = {2015},
   pages = {246--257},
   note = {11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29--July 3, 2015},
   doi = {10.1007/978-3-319-20028-6_25},
}

@article{LRP15a,
   author = {Le Roux, St{\'{e}}phane and Pauly, Arno},
   title = {Finite choice, convex choice and finding roots},
   journal = {Logical Methods in Computer Science},
   volume = {11},
   number = {4},
   year = {2015},
   pages = {4:6, 31},
   doi = {10.2168/LMCS-11(4:6)2015},
}

@electronic{LS23,
   author = {Lutz, Patrick and Siskind, Benjamin},
   title = {Part 1 of {M}artin's Conjecture for order-preserving and measure-preserving functions},
   howpublished = {arXiv 2305.19646},
   year = {2023},
}

@article{LS24,
   author = {Lutz, Patrick and Siskind, Benjamin},
   title = {Part 1 of {M}artin’s Conjecture for order-preserving and measure-preserving functions},
   journal = {Journal of the American Mathematical Society},
   year = {2024},
   doi = {10.1090/jams/1046},
}

@phdthesis{Lut21,
   author = {Lutz, Patrick},
   title = {Results on {M}artin's Conjecture},
   school = {University of California, Berkeley},
   year = {2021},
}

@electronic{Lut23,
   author = {Lutz, Patrick},
   title = {The {S}olecki dichotomy and the {P}ossner-{R}obinson theorem are almost equivalent},
   howpublished = {arXiv 2301.07259},
   year = {2023},
}

@electronic{MO24,
   author = {Marcone, Alberto and Osso, Gian Marco},
   title = {The {G}alvin-{P}rikry theorem in the Weihrauch lattice},
   howpublished = {arXiv 2410.06928},
   year = {2024},
}

@electronic{Mou24,
   author = {Mourad, Daniel},
   title = {There is No Composition in the Computable Reducibility Degrees},
   howpublished = {arXiv 2405.15281},
   year = {2024},
}

@article{MP19,
   author = {Monin, Benoit and Patey, Ludovic},
   title = {{$\Pi^0_1$}-encodability and omniscient reductions},
   journal = {Notre Dame Journal of Formal Logic},
   volume = {60},
   number = {1},
   year = {2019},
   pages = {1--12},
   doi = {10.1215/00294527-2018-0020},
}

@electronic{MV20,
   author = {Marcone, Alberto and Valenti, Manlio},
   title = {The open and clopen {R}amsey theorems in the {W}eihrauch lattice},
   howpublished = {arXiv 2003.04245},
   year = {2020},
}

@article{MV21,
   author = {Marcone, Alberto and Valenti, Manlio},
   title = {The open and clopen {R}amsey theorems in the {W}eihrauch lattice},
   journal = {The Journal of Symbolic Logic},
   volume = {86},
   number = {1},
   year = {2021},
   pages = {316--351},
   doi = {10.1017/jsl.2021.10},
}

@electronic{MV21a,
   author = {Marcone, Alberto and Valenti, Manlio},
   title = {Effective aspects of {H}ausdorff and {F}ourier dimension},
   howpublished = {arXiv 2108.06941},
   year = {2021},
}

@article{MV22,
   author = {Marcone, Alberto and Valenti, Manlio},
   title = {Effective aspects of {H}ausdorff and {F}ourier dimension },
   journal = {Computability},
   volume = {11},
   number = {3-4},
   year = {2022},
   pages = {299--333},
   doi = {10.3233/COM-210372},
}

@phdthesis{Myl06,
   author = {Mylatz, Uwe},
   title = {Vergleich unstetiger {F}unktionen: ``{P}rinciple of {O}mniscience'' und {V}ollst{\"a}ndigkeit in der {$C$}--Hierarchie},
   school = {Faculty for Mathematics and Computer Science, University Hagen},
   address = {Hagen, Germany},
   year = {2006},
   note = {{Ph.D.} thesis},
}

@article{Neu15,
   author = {Neumann, Eike},
   title = {Computational Problems in Metric Fixed Point Theory and their {W}eihrauch Degrees},
   journal = {Logical Methods in Computer Science},
   volume = {11},
   year = {2015},
   pages = {4:20,44},
   doi = {10.2168/LMCS-11(4:20)2015},
}

@electronic{Nic17,
   author = {Nichols, David},
   title = {Strong Reductions between Relatives of the Stable {R}amsey's Theorem},
   howpublished = {arXiv 1711.06532},
   year = {2017},
}

@phdthesis{Nob18,
   author = {Nobrega, Hugo},
   title = {Games for functions - {B}aire classes, {W}eihrauch degrees, Transfinite Computations, and Ranks},
   school = {Institute for Logic, Language and Computation, Universiteit van Amsterdam},
   year = {2018},
}

@inproceedings{NP17,
   author = {Nobrega, Hugo and Pauly, Arno},
   title = {Game Characterizations and Lower Cones in the {W}eihrauch Degrees},
   editor = {Kari, Jarkko and Manea, Florin and Petre, Ion},
   booktitle = {Unveiling Dynamics and Complexity},
   series = {Lecture Notes in Computer Science},
   volume = {10307},
   publisher = {Springer},
   address = {Cham},
   year = {2017},
   pages = {327--337},
   note = {13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017},
   doi = {10.1007/978-3-319-58741-7_31},
}

@article{NP18,
   author = {Eike Neumann and Arno Pauly},
   title = {A topological view on algebraic computation models},
   journal = {Journal of Complexity},
   volume = {44},
   number = {Supplement C},
   year = {2018},
   pages = {1--22},
   doi = {10.1016/j.jco.2017.08.003},
}

@article{NP19,
   author = {Nobrega, Hugo and Pauly, Arno},
   title = {Game characterizations and lower cones in the {W}eihrauch degrees},
   journal = {Logical Methods in Computer Science},
   volume = {15},
   number = {3},
   year = {2019},
   pages = {Paper No. 11, 29},
   doi = {10.23638/LMCS-15(3:11)2019},
}

@phdthesis{Pat16,
   author = {Patey, Ludovic},
   title = {The reverse mathematics of {R}amsey-type theorems},
   school = {Universit{\'e} Paris Diderot},
   address = {Paris, France},
   year = {2016},
}

@article{Pat16a,
   author = {Patey, Ludovic},
   title = {The weakness of being cohesive, thin or free in reverse mathematics},
   journal = {Israel Journal of Mathematics},
   volume = {216},
   year = {2016},
   pages = {905--955},
   doi = {10.1007/s11856-016-1433-3},
}

@inproceedings{Pau09,
   author = {Pauly, Arno},
   title = {How Discontinuous is Computing {N}ash Equilibria? ({E}xtended Abstract)},
   editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I},
   booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)},
   series = {OpenAccess Series in Informatics (OASIcs)},
   volume = {11},
   publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
   address = {Dagstuhl, Germany},
   year = {2009},
   doi = {10.4230/OASIcs.CCA.2009.2271},
}

@article{Pau10,
   author = {Pauly, Arno},
   title = {How Incomputable is Finding {N}ash Equilibria?},
   journal = {Journal of Universal Computer Science},
   volume = {16},
   number = {18},
   year = {2010},
   pages = {2686--2710},
   doi = {10.3217/jucs-016-18-2686},
}

@article{Pau10a,
   author = {Pauly, Arno},
   title = {On the (semi)lattices induced by continuous reducibilities},
   journal = {Mathematical Logic Quarterly},
   volume = {56},
   number = {5},
   year = {2010},
   pages = {488--502},
   doi = {10.1002/malq.200910104},
}

@phdthesis{Pau11,
   author = {Pauly, Arno},
   title = {Computable Metamathematics and its Application to Game Theory},
   school = {University of Cambridge, Computer Laboratory, Clare College},
   address = {Cambridge},
   year = {2011},
   note = {{Ph.D.} thesis},
}

@electronic{Pau15,
   author = {Pauly, Arno},
   title = {Computability on the space of countable ordinals},
   howpublished = {arXiv 1501.00386},
   year = {2015},
}

@article{Pau17,
   author = {Pauly, Arno},
   title = {Many-one reductions and the category of multivalued functions},
   journal = {Mathematical Structures in Computer Science},
   volume = {27},
   number = {3},
   year = {2017},
   pages = {376--404},
   doi = {10.1017/S0960129515000262},
}

@electronic{Pau20,
   author = {Pauly, Arno},
   title = {An update on {W}eihrauch complexity, and some open questions},
   howpublished = {arXiv 2008.11168},
   year = {2020},
}

@electronic{PdB13,
   author = {Pauly, Arno and de Brecht, Matthew},
   title = {Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces},
   howpublished = {arXiv 1307.1850},
   year = {2013},
}

@inproceedings{PdB14,
   author = {Pauly, Arno and de Brecht, Matthew},
   title = {Non-deterministic computation and the {J}ayne-{R}ogers Theorem},
   editor = {L{\"{o}}we, Benedikt and Winskel, Glynn},
   booktitle = {Proceedings 8th International Workshop on Developments in Computational Models, {DCM} 2012, Cambridge, United Kingdom, 17 June 2012.},
   series = {Electronic Proceedings in Theoretical Computer Science},
   volume = {143},
   year = {2014},
   pages = {87--96},
   doi = {10.4204/EPTCS.143.8},
}

@inproceedings{PdB15,
   author = {Pauly, Arno and de Brecht, Matthew},
   title = {Descriptive Set Theory in the Category of Represented Spaces},
   booktitle = {30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
   year = {2015},
   pages = {438-449},
   doi = {10.1109/LICS.2015.48},
}

@article{PDD17,
   author = {Porter, Michelle and Day, Adam and Downey, Rodney},
   title = {Notes on computable analysis},
   journal = {Theory of Computing Systems},
   volume = {60},
   number = {1},
   year = {2017},
   pages = {53--111},
   doi = {10.1007/s00224-016-9732-y},
}

@article{PF17,
   author = {Pauly, Arno and Fouch{\'e}, Willem L.},
   title = {How constructive is constructing measures?},
   journal = {Journal of Logic \& Analysis},
   volume = {9},
   number = {c3},
   year = {2017},
   pages = {1--44},
   doi = {10.4115/jla.2017.9.c3},
}

@article{PFD18,
   author = {Pauly, Arno and Fouch{\'{e}}, Willem and Davie, George},
   title = {{W}eihrauch-completeness for layerwise computability},
   journal = {Logical Methods in Computer Science},
   volume = {14},
   number = {2},
   year = {2018},
   month = May,
   doi = {10.23638/LMCS-14(2:11)2018},
}

@article{PPS24,
   author = {Pauly, Arno and Pradic, C{\'e}cilia and Sold{\'{a}}, Giovanni},
   title = {On the {W}eihrauch degree of the additive {R}amsey theorem},
   journal = {Computability},
   volume = {13},
   number = {3--4},
   year = {2024},
   pages = {459--483},
   doi = {10.3233/COM-230437},
}

@inproceedings{PS16,
   author = {Pauly, Arno and Steinberg, Florian},
   title = {Representations of analytic functions and {W}eihrauch degrees},
   booktitle = {Computer science---theory and applications},
   series = {Lecture Notes in Computer Science},
   volume = {9691},
   publisher = {Springer},
   address = {Cham},
   year = {2016},
   pages = {367--381},
   doi = {10.1007/978-3-319-34171-2_26},
}

@article{PS18,
   author = {Pauly, Arno and Steinberg, Florian},
   title = {Comparing Representations for Function Spaces in Computable Analysis},
   journal = {Theory of Computing Systems},
   volume = {62},
   year = {2018},
   pages = {557--582},
   doi = {10.1007/s00224-016-9745-6},
}

@incollection{PS22,
   author = {Pradic, Pierre and Sold\`a, Giovanni},
   title = {On the {W}eihrauch degree of the additive {R}amsey theorem over the rationals},
   booktitle = {Revolutions and revelations in computability},
   series = {Lecture Notes in Computer Science},
   volume = {13359},
   publisher = {Springer},
   address = {Cham},
   year = {2022},
   pages = {259--271},
   doi = {10.1007/978-3-031-08740-0\_22},
}

@electronic{PS24,
   author = {Pauly, Arno and Sold{\'{a}}, Giovanni},
   title = {Sequential discontinuity and first-order problems},
   howpublished = {arXiv 2401.12641},
   year = {2024},
   doi = {arXiv.2401.12641},
}

@inproceedings{PS24a,
   author = {Pauly, Arno and Sold{\`a}, Giovanni},
   title = {Sequential Discontinuity and First-Order Problems},
   editor = {Levy Patey, Ludovic and Pimentel, Elaine and Galeotti, Lorenzo and Manea, Florin},
   booktitle = {Twenty Years of Theoretical and Practical Synergies},
   publisher = {Springer Nature Switzerland},
   address = {Cham},
   year = {2024},
   pages = {351--365},
   doi = {10.1007/978-3-031-64309-5_28},
}

@electronic{PT16,
   author = {Pauly, Arno and Tsuiki, Hideki},
   title = {Computable dyadic subbases and $\mathbb{T}^\omega$-representations of compact sets},
   howpublished = {arXiv 1604.0258},
   year = {2016},
}

@phdthesis{Rak15,
   author = {Rakotoniaina, Tahina},
   title = {On the Computational Strength of {R}amsey's Theorem},
   school = {Department of Mathematics and Applied Mathematics, University of Cape Town},
   address = {Rondebosch, South Africa},
   year = {2015},
   note = {{Ph.D.} thesis},
}

@article{Sel13,
   author = {Selivanov, Victor},
   title = {Total Representations},
   journal = {Logical Methods in Computer Science},
   volume = {9},
   year = {2013},
   pages = {2:5, 30},
   doi = {10.2168/LMCS-9(2:5)2013},
}

@article{Sel20,
   author = {Selivanov, Victor},
   title = {Q-{W}adge degrees as free structures},
   journal = {Computability},
   volume = {9},
   number = {3-4},
   year = {2020},
   pages = {327--341},
   doi = {10.3233/COM-180241},
}

@inproceedings{Sol16,
   author = {Solomon, Reed},
   title = {Computable Reductions and Reverse Mathematics},
   editor = {Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nata\v{s}a},
   booktitle = {Pursuit of the Universal},
   series = {Lecture Notes in Computer Science},
   volume = {9709},
   publisher = {Springer},
   address = {Switzerland},
   year = {2016},
   pages = {182--191},
   note = {12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016},
   doi = {10.1007/978-3-319-40189-8_19},
}

@electronic{SV22,
   author = {Sold{\`a}, Giovanni and Valenti, Manlio},
   title = {Algebraic properties of the first-order part of a problem},
   howpublished = {arXiv 2203.16298},
   year = {2022},
}

@article{SV23,
   author = {Sold{\`a}, Giovanni and Valenti, Manlio},
   title = {Algebraic properties of the first-order part of a problem},
   journal = {Annals of Pure and Applied Logic},
   volume = {174},
   number = {7},
   year = {2023},
   pages = {103270},
   doi = {10.1016/j.apal.2023.103270},
}

@article{SY24,
   author = {Suzuki, Yudai and Yokoyama, Keita},
   title = {Searching problems above arithmetical transfinite recursion},
   journal = {Annals of Pure and Applied Logic},
   volume = {175},
   number = {10},
   year = {2024},
   pages = {Paper No. 103488, 31},
   doi = {10.1016/j.apal.2024.103488},
}

@phdthesis{Thi18,
   author = {Thies, Holger},
   title = {Uniform computational complexity of ordinary differential equations with applications to dynamical systems and exact real arithmetic},
   school = {Graduate School of Arts and Sciences, University of Tokyo},
   address = {Tokyo, Japan},
   year = {2018},
}

@electronic{TVdP22,
   author = {Trotta, Davide and Valenti, Manlio and de Paiva, Valeria},
   title = {Categorifying Computable Reducibilities},
   howpublished = {arXiv 2208.08656},
   year = {2022},
   doi = {10.48550/arxiv.2208.08656},
}

@article{TW11,
   author = {Tavana, Nazanin R.\ and Weihrauch, Klaus},
   title = {Turing machines on represented sets, a model of computation for analysis},
   journal = {Logical Methods in Computer Science},
   volume = {7},
   number = {2},
   year = {2011},
   pages = {2:19, 21},
   doi = {10.2168/LMCS-7(2:19)2011},
}

@electronic{Uft20,
   author = {Uftring, Patrick},
   title = {The characterization of {W}eihrauch reducibility in systems containing {E-PA$^{\omega}$} + {QF-AC$^{0,0}$}},
   howpublished = {arXiv 2003.13331},
   year = {2020},
}

@article{Uft21,
   author = {Uftring, Patrick},
   title = {The characterization of {W}eihrauch reducibility in systems containing {E-PA$^{\omega}$} + {QF-AC$^{0,0}$}},
   journal = {The Journal of Symbolic Logic},
   volume = {86},
   number = {1},
   year = {2021},
   pages = {224--261},
   doi = {10.1017/jsl.2020.53},
}

@electronic{Uft23,
   author = {Uftring, Patrick},
   title = {Weihrauch degrees without roots},
   howpublished = {arXiv 2102.11832},
   year = {2023},
}

@phdthesis{Val21,
   author = {Valenti, Manlio},
   title = {A journey through computability, topology and analysis},
   type = {{Ph.D.} thesis},
   school = {Universit{\'a} degli Studi di Udine},
   year = {2021},
}

@book{Wei00,
   author = {Weihrauch, Klaus},
   title = {Computable Analysis},
   publisher = {Springer},
   address = {Berlin},
   year = {2000},
}

@article{Wei19,
   author = {Weihrauch, Klaus},
   title = {Computable planar curves intersect in a computable point},
   journal = {Computability},
   volume = {8},
   number = {3, 4},
   year = {2019},
   pages = {399--415},
   doi = {10.3233/COM-180102},
}

@techreport{Wei92a,
   author = {Weihrauch, Klaus},
   title = {The degrees of discontinuity of some translators between representations of the real numbers},
   type = {Technical Report},
   number = {TR-92-050},
   institution = {International Computer Science Institute},
   address = {Berkeley},
   year = {1992},
   month = jul,
}

@techreport{Wei92b,
   author = {Weihrauch, Klaus},
   title = {The degrees of discontinuity of some translators between representations of the real numbers},
   type = {Informatik Berichte},
   number = {129},
   institution = {FernUniversit\"at Hagen},
   address = {Hagen},
   year = {1992},
   month = jul,
}

@techreport{Wei92c,
   author = {Weihrauch, Klaus},
   title = {The {TTE}-interpretation of three hierarchies of omniscience principles},
   type = {Informatik Berichte},
   number = {130},
   institution = {FernUniversit\"at Hagen},
   address = {Hagen},
   year = {1992},
   month = sep,
}

@electronic{Wes20,
   author = {Westrick, Linda},
   title = {A note on the diamond operator},
   howpublished = {arXiv 2001.09372},
   year = {2020},
}

@article{Wes21,
   author = {Westrick, Linda},
   title = {A note on the diamond operator},
   journal = {Computability},
   volume = {10},
   number = {2},
   year = {2021},
   pages = {107--110},
   doi = {10.3233/COM-200295},
}

% 
% This bibliography has 237 entries
%