| Bounded functional interpretation F Ferreira, P Oliva Annals of Pure and Applied Logic 135 (1-3), 73-112, 2005 | 111 | 2005 |
| Proof mining: a systematic way of analyzing proofs in mathematics U Kohlenbach, P Oliva Труды Математического института имени ВА Стеклова 242 (0), 147-175, 2003 | 110 | 2003 |
| Modified bar recursion and classical dependent choice U Berger, P Oliva Logic Colloquium 1, 89-107, 2005 | 88 | 2005 |
| Selection functions, bar recursion and backward induction M Escardó, P Oliva Mathematical structures in computer science 20 (2), 127-168, 2010 | 73 | 2010 |
| Sequential games and optimal strategies M Escardó, P Oliva Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2011 | 53 | 2011 |
| Unifying functional interpretations P Oliva Notre Dame Journal of Formal Logic 47 (2), 263-290, 2006 | 48 | 2006 |
| On various negative translations G Ferreira, P Oliva arXiv preprint arXiv:1101.5442, 2011 | 45 | 2011 |
| On Krivine's realizability interpretation of classical second-order arithmetic P Oliva, T Streicher Fundamenta Informaticae 84 (2), 207-220, 2008 | 43 | 2008 |
| Modified bar recursion U Berger, P Oliva Mathematical Structures in Computer Science 16 (2), 163-183, 2006 | 42 | 2006 |
| Proof mining in L1-approximation U Kohlenbach, P Oliva Annals of Pure and Applied Logic 121 (1), 1-38, 2003 | 42 | 2003 |
| Understanding and using Spector’s bar recursive interpretation of classical analysis P Oliva Logical Approaches to Computational Barriers: Second Conference on …, 2006 | 41 | 2006 |
| On the relation between various negative translations G Ferreira, P Oliva Logic, construction, computation 3, 227-258, 2012 | 33 | 2012 |
| Bar recursion and products of selection functions M Escardó, P Oliva The Journal of Symbolic Logic 80 (1), 1-28, 2015 | 31 | 2015 |
| Reporting exact and approximate regular expression matches EW Myers, P Oliva, K Guimarăes Combinatorial Pattern Matching: 9th Annual Symposium, CPM 98 Piscataway, New …, 1998 | 28 | 1998 |
| A constructive interpretation of Ramsey's Theorem via the product of selection functions P Oliva, T Powell Mathematical structures in computer science 25 (8), 1755-1778, 2015 | 27 | 2015 |
| Bounded functional interpretation and feasible analysis F Ferreira, P Oliva Annals of Pure and Applied Logic 145 (2), 115-129, 2007 | 27 | 2007 |
| What sequential games, the Tychonoff theorem and the double-negation shift have in common M Escardó, P Oliva Proceedings of the third ACM SIGPLAN workshop on Mathematically structured …, 2010 | 25 | 2010 |
| The Peirce translation and the double negation shift M Escardó, P Oliva Conference on Computability in Europe, 151-161, 2010 | 23 | 2010 |
| Computational interpretations of analysis via products of selection functions M Escardó, P Oliva Programs, Proofs, Processes: 6th Conference on Computability in Europe, CiE …, 2010 | 23 | 2010 |
| Computing Nash Equilibria of Unbounded Games. MH Escardó, P Oliva Turing-100 10, 53-65, 2012 | 22 | 2012 |
Martín Hötzel EscardóProfessor of Theoretical Computer Science, University of Birmingham,UKVerified email at cs.bham.ac.uk
