Paulo Oliva

Most-cited papers

Proof Mining: A Systematic Way of Analysing Proofs in Mathematics
U. Kohlenbach, Paulo Oliva
200294 citations Open access
Semantic Scholar
Bounded functional interpretation
Fernando Ferreira, Paulo Oliva
2005Annals of Pure and Applied Logic91 citations Open access
Semantic Scholar
MODIFIED BAR RECURSION AND CLASSICAL DEPENDENT CHOICE
Ulrich Berger, Paulo Oliva
200471 citations
Semantic Scholar
Selection functions, bar recursion and backward induction
M. Escardó, Paulo Oliva
2010Mathematical Structures in Computer Science64 citations Open access
Semantic Scholar
Sequential games and optimal strategies
M. Escardó, Paulo Oliva
2011Proceedings of the Royal Society A53 citations Open access
Semantic Scholar
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
Paulo Oliva
2006Conference on Computability in Europe45 citations
Semantic Scholar
Unifying Functional Interpretations
Paulo Oliva
2006Notre Dame J. Formal Log.41 citations Open access
Semantic Scholar
Modified bar recursion
Ulrich Berger, Paulo Oliva
2002Mathematical Structures in Computer Science40 citations Open access
Semantic Scholar
On Various Negative Translations
Gilda Ferreira, Paulo Oliva
2011CL&C38 citations Open access
Semantic Scholar
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
Paulo Oliva, T. Streicher
2008Fundamenta Informaticae32 citations
Semantic Scholar
Proof mining in L1-approximation
U. Kohlenbach, Paulo Oliva
2003Annals of Pure and Applied Logic29 citations Open access
Semantic Scholar
BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS
M. Escardó, Paulo Oliva
2014Journal of Symbolic Logic (JSL)27 citations Open access
Semantic Scholar
On the Relation Between Various Negative Trans- lations
Gilda Ferreira, Paulo Oliva, P. Oliva
201224 citations
Semantic Scholar
A constructive interpretation of Ramsey's theorem via the product of selection functions
Paulo Oliva, Thomas Powell
2012Mathematical Structures in Computer Science24 citations Open access
Semantic Scholar
Hybrid Functional Interpretations
Mircea Dan Hernest, Paulo Oliva
2008Conference on Computability in Europe23 citations
Semantic Scholar
Computing Nash Equilibria of Unbounded Games
M. Escardó, Paulo Oliva
2012Turing-10022 citations Open access
Semantic Scholar
Bounded functional interpretation and feasible analysis
Fernando Ferreira, Paulo Oliva
2007Annals of Pure and Applied Logic22 citations Open access
Semantic Scholar
Reporting Exact and Approximate Regular Expression Matches
E. Myers, Paulo Oliva, Katia S. Guimarães
1998Annual Symposium on Combinatorial Pattern Matching22 citations
Semantic Scholar
An Analysis of Gödel's dialectica Interpretation via Linear Logic
Paulo Oliva
200821 citations
Semantic Scholar
Effective Bounds on Strong Unicity in L1-Approximation
U. Kohlenbach, Paulo Oliva
200121 citations Open access
Semantic Scholar
Computational Interpretations of Analysis via Products of Selection Functions
M. Escardó, Paulo Oliva
2010Conference on Computability in Europe19 citations
Semantic Scholar
Computational Interpretations of Classical Linear Logic
Paulo Oliva
2007Workshop on Logic, Language, Information and Computation19 citations Open access
Semantic Scholar
On Spector's bar recursion
Paulo Oliva, Thomas Powell
2012Mathematical Logic Quarterly16 citations
Semantic Scholar
The Peirce Translation and the Double Negation Shift
M. Escardó, Paulo Oliva
2010Conference on Computability in Europe16 citations
Semantic Scholar
Modified Realizability Interpretation of Classical Linear Logic
Paulo Oliva
2007Logic in Computer Science16 citations
Semantic Scholar
Higher-Order Decision Theory
Jules Hedges, Paulo Oliva, Evguenia Sprits, Viktor Winschel +1 more
2015Algorithmic Decision Theory15 citations
Semantic Scholar
Functional Interpretations of Intuitionistic Linear Logic
Gilda Ferreira, Paulo Oliva
2009Annual Conference for Computer Science Logic15 citations Open access
Semantic Scholar
Hybrid Functional Interpretations of Linear and Intuitionistic Logic
Paulo Oliva
2012Journal of Logic and Computation14 citations
Semantic Scholar
Functional interpretations of linear and intuitionistic logic
Paulo Oliva
2010Information and Computation14 citations Open access
Semantic Scholar
On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem
R. Arthan, Paulo Oliva
2021Journal of Logic and Analysis13 citations Open access
Semantic Scholar
A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM
Paulo Oliva, Silvia Steila
2016Journal of Symbolic Logic (JSL)13 citations Open access
Semantic Scholar
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
Paulo Oliva, Thomas Powell
2012arXiv.org13 citations Open access
Semantic Scholar
System T and the Product of Selection Functions
M. Escardó, Paulo Oliva, Thomas Powell
2011Annual Conference for Computer Science Logic13 citations
Semantic Scholar
THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT
M. Escardó, Paulo Oliva
2014Journal of Symbolic Logic (JSL)12 citations Open access
Semantic Scholar
The Peirce translation
M. Escardó, Paulo Oliva
2012Annals of Pure and Applied Logic12 citations Open access
Semantic Scholar
Proof mining in L 1-approximation
U. Kohlenbach, Paulo Oliva, Brics
200112 citations
Semantic Scholar
Selection Equilibria of Higher-Order Games
Jules Hedges, Paulo Oliva, Evguenia Shprits, Viktor Winschel +1 more
2017International Symposium on Practical Aspects of Declarative Languages11 citations
Semantic Scholar
A Hoare logic for linear systems
R. Arthan, U. Martin, Paulo Oliva
2013Formal Aspects of Computing9 citations Open access
Semantic Scholar
Searchable Sets, Dubuc-Penon Compactness, Omniscience Principles, and the Drinker Paradox
M. Escardó, Paulo Oliva
20108 citations
Semantic Scholar
Proof interpretations with truth
Jaime Gaspar, Paulo Oliva
2010Mathematical Logic Quarterly8 citations
Semantic Scholar
On the Computational Complexity of Best L1-approximation
Paulo Oliva
2002Mathematical Logic Quarterly8 citations
Semantic Scholar
On the Computational Complexity of Best L1‐approximation
Paulo Oliva
20028 citations
Semantic Scholar
Hoare Logic in the Abstract
U. Martin, E. A. Mathiesen, Paulo Oliva
2006Annual Conference for Computer Science Logic7 citations
Semantic Scholar
Proving termination with transition invariants of height omega
S. Berardi, Paulo Oliva, Silvia Steila
2014arXiv.org6 citations
Semantic Scholar
Polynomial-time algorithms from ineffective proofs
Paulo Oliva
200318th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.6 citations Open access
Semantic Scholar
A systematic way of analysing proofs in probability theory
Morenikeji Neri, Paulo Oliva, Nicholas Pischke
20265 citations
Semantic Scholar
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
S. Berardi, Paulo Oliva, Silvia Steila
2019Journal of Logic and Computation5 citations Open access
Semantic Scholar
Higher-Order Game Theory
Jules Hedges, Paulo Oliva, Evguenia Sprits, Viktor Winschel +1 more
2015arXiv.org5 citations
Semantic Scholar
Bar recursion over finite partial functions
Paulo Oliva, Thomas Powell
2014Annals of Pure and Applied Logic5 citations Open access
Semantic Scholar
Confined modified realizability
Gilda Ferreira, Paulo Oliva
2010Mathematical Logic Quarterly5 citations
Semantic Scholar