Paulo Oliva

Orcid: 0000-0002-0492-4855

According to our database1, Paulo Oliva authored at least 59 papers between 1998 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Higher-order games with dependent types.
Theor. Comput. Sci., September, 2023

2021
Kripke Semantics for Intuitionistic Łukasiewicz Logic.
Stud Logica, 2021

Double Negation Semantics for Generalisations of Heyting Algebras.
Stud Logica, 2021

On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem.
J. Log. Anal., 2021

On Rational Choice and the Representation of Decision Problems.
Games, 2021

A parametrised functional interpretation of Heyting arithmetic.
Ann. Pure Appl. Log., 2021

2020
On the Herbrand functional interpretation.
Math. Log. Q., 2020

2019
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion.
J. Log. Comput., 2019

Negative Translations for Affine and Lukasiewicz Logic.
CoRR, 2019

Studying Algebraic Structures using Prover9 and Mace4.
CoRR, 2019

2018
A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem.
J. Symb. Log., 2018

A Curry-Howard Correspondence for the Minimal Fragment of Łukasiewicz Logic.
CoRR, 2018

Buying Online - A Characterization of Rational Buying Procedures.
CoRR, 2018

2017
The Herbrand Functional Interpretation of the double Negation Shift.
J. Symb. Log., 2017

Bar recursion over finite partial functions.
Ann. Pure Appl. Log., 2017

Selection Equilibria of Higher-Order Games.
Proceedings of the Practical Aspects of Declarative Languages, 2017

Higher-Order Decision Theory.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2015
A constructive interpretation of Ramsey's theorem via the product of selection functions.
Math. Struct. Comput. Sci., 2015

Bar Recursion and Products of Selection Functions.
J. Symb. Log., 2015

Higher-Order Game Theory.
CoRR, 2015

2014
Unifying Functional Interpretations: Past and Future.
CoRR, 2014

A Higher-order Framework for Decision Problems and Games.
CoRR, 2014

Proving termination with transition invariants of height omega.
CoRR, 2014

On Pocrims and Hoops.
CoRR, 2014

On Affine Logic and Łukasiewicz Logic.
CoRR, 2014

Proving termination of programs having transition invariants of height ω.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013
A Hoare logic for linear systems.
Formal Aspects Comput., 2013

(Dual) Hoops Have Unique Halving.
Proceedings of the Automated Reasoning and Mathematics, 2013

2012
On Spector's bar recursion.
Math. Log. Q., 2012

Hybrid Functional Interpretations of Linear and Intuitionistic Logic.
J. Log. Comput., 2012

A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
CoRR, 2012

On bounded functional interpretations.
Ann. Pure Appl. Log., 2012

The Peirce translation.
Ann. Pure Appl. Log., 2012

Computing Nash Equilibria of Unbounded Games.
Proceedings of the Turing-100, 2012

2011
Functional Interpretations of Intuitionistic Linear Logic
Log. Methods Comput. Sci., 2011

System T and the Product of Selection Functions.
Proceedings of the Computer Science Logic, 2011

2010
Selection functions, bar recursion and backward induction.
Math. Struct. Comput. Sci., 2010

Proof interpretations with truth.
Math. Log. Q., 2010

Confined modified realizability.
Math. Log. Q., 2010

Functional interpretations of linear and intuitionistic logic.
Inf. Comput., 2010

On Various Negative Translations
Proceedings of the Proceedings Third International Workshop on Classical Logic and Computation, 2010

What Sequential Games, the Tychonoff Theorem and the Double-Negation Shift Have in Common.
Proceedings of the 3rd ACM SIGPLAN Workshop on Mathematically Structured Functional Programming, 2010

The Peirce Translation and the Double Negation Shift.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Computational Interpretations of Analysis via Products of Selection Functions.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
A general framework for sound and complete Floyd-Hoare logics.
ACM Trans. Comput. Log., 2009

2008
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic.
Fundam. Informaticae, 2008

Hybrid Functional Interpretations.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Bounded functional interpretation and feasible analysis.
Ann. Pure Appl. Log., 2007

Computational Interpretations of Classical Linear Logic.
Proceedings of the Logic, 2007

Modified Realizability Interpretation of Classical Linear Logic.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
Unifying Functional Interpretations.
Notre Dame J. Formal Log., 2006

Modified bar recursion.
Math. Struct. Comput. Sci., 2006

Hoare Logic in the Abstract.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Bounded functional interpretation.
Ann. Pure Appl. Log., 2005

2003
Proof mining in <i>L</i><sub>1</sub>-approximation.
Ann. Pure Appl. Log., 2003

Polynomial-time Algorithms from Ineffective Proofs.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

2002
On the Computational Complexity of Best <i>L</i><sub>1</sub>-approximation.
Math. Log. Q., 2002

1998
Reporting Exact and Approximate Regular Expression Matches.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998


  Loading...