default search action
Paulo Oliva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j31]Martín Escardó, Paulo Oliva:
Higher-order games with dependent types. Theor. Comput. Sci. 974: 114111 (2023) - 2022
- [i21]Martín Escardó, Paulo Oliva:
Higher-order Games with Dependent Types. CoRR abs/2212.07735 (2022) - 2021
- [j30]Bruno Dinis, Paulo Oliva:
A parametrised functional interpretation of Heyting arithmetic. Ann. Pure Appl. Log. 172(4): 102940 (2021) - [j29]Paulo Oliva, Philipp Zahn:
On Rational Choice and the Representation of Decision Problems. Games 12(4): 86 (2021) - [j28]Rob Arthan, Paulo Oliva:
On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem. J. Log. Anal. 13 (2021) - [j27]A. Lewis-Smith, Paulo Oliva, Edmund Robinson:
Kripke Semantics for Intuitionistic Łukasiewicz Logic. Stud Logica 109(2): 313-339 (2021) - [j26]Rob Arthan, Paulo Oliva:
Double Negation Semantics for Generalisations of Heyting Algebras. Stud Logica 109(2): 341-365 (2021) - 2020
- [j25]Paulo Oliva, Chuangjie Xu:
On the Herbrand functional interpretation. Math. Log. Q. 66(1): 91-98 (2020)
2010 – 2019
- 2019
- [j24]Stefano Berardi, Paulo Oliva, Silvia Steila:
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion. J. Log. Comput. 29(4): 555-575 (2019) - [i20]Rob Arthan, Paulo Oliva:
Studying Algebraic Structures using Prover9 and Mace4. CoRR abs/1908.06479 (2019) - [i19]Rob Arthan, Paulo Oliva:
Negative Translations for Affine and Lukasiewicz Logic. CoRR abs/1912.00012 (2019) - [i18]Paulo Oliva, Chuangjie Xu:
On the Herbrand Functional Interpretation. CoRR abs/1912.01333 (2019) - 2018
- [j23]Paulo Oliva, Silvia Steila:
A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. J. Symb. Log. 83(1): 70-83 (2018) - [i17]Paulo Oliva, Philipp Zahn:
Buying Online - A Characterization of Rational Buying Procedures. CoRR abs/1801.03483 (2018) - [i16]Rob Arthan, Paulo Oliva:
A Curry-Howard Correspondence for the Minimal Fragment of Łukasiewicz Logic. CoRR abs/1809.04492 (2018) - 2017
- [j22]Paulo Oliva, Thomas Powell:
Bar recursion over finite partial functions. Ann. Pure Appl. Log. 168(5): 887-921 (2017) - [j21]Martín Escardó, Paulo Oliva:
The Herbrand Functional Interpretation of the double Negation Shift. J. Symb. Log. 82(2): 590-607 (2017) - [c18]Jules Hedges, Paulo Oliva, Evguenia Shprits, Viktor Winschel, Philipp Zahn:
Higher-Order Decision Theory. ADT 2017: 241-254 - [c17]Jules Hedges, Paulo Oliva, Evguenia Shprits, Viktor Winschel, Philipp Zahn:
Selection Equilibria of Higher-Order Games. PADL 2017: 136-151 - 2015
- [j20]Martín Escardó, Paulo Oliva:
Bar Recursion and Products of Selection Functions. J. Symb. Log. 80(1): 1-28 (2015) - [j19]Paulo Oliva, Thomas Powell:
A constructive interpretation of Ramsey's theorem via the product of selection functions. Math. Struct. Comput. Sci. 25(8): 1755-1778 (2015) - [i15]Jules Hedges, Paulo Oliva, Evguenia Sprits, Viktor Winschel, Philipp Zahn:
Higher-Order Game Theory. CoRR abs/1506.01002 (2015) - [i14]Jules Hedges, Paulo Oliva, Evguenia Sprits, Viktor Winschel, Philipp Zahn:
Higher-Order Decision Theory. CoRR abs/1506.01003 (2015) - 2014
- [c16]Stefano Berardi, Paulo Oliva, Silvia Steila:
Proving termination of programs having transition invariants of height ω. ICTCS 2014: 237-240 - [e1]Paulo Oliva:
Proceedings Fifth International Workshop on Classical Logic and Computation, CL&C 2014, Vienna, Austria, July 13, 2014. EPTCS 164, 2014 [contents] - [i13]Rob Arthan, Paulo Oliva:
On Affine Logic and Łukasiewicz Logic. CoRR abs/1404.0570 (2014) - [i12]Rob Arthan, Paulo Oliva:
On Pocrims and Hoops. CoRR abs/1404.0816 (2014) - [i11]Stefano Berardi, Paulo Oliva, Silvia Steila:
Proving termination with transition invariants of height omega. CoRR abs/1407.4692 (2014) - [i10]Martín Hötzel Escardó, Paulo Oliva:
Bar Recursion and Products of Selection Functions. CoRR abs/1407.7046 (2014) - [i9]Jules Hedges, Paulo Oliva, Evguenia Winschel, Viktor Winschel, Philipp Zahn:
A Higher-order Framework for Decision Problems and Games. CoRR abs/1409.7411 (2014) - [i8]Martín Hötzel Escardó, Paulo Oliva:
The Herbrand Functional Interpretation of the Double Negation Shift. CoRR abs/1410.4353 (2014) - [i7]Paulo Oliva:
Unifying Functional Interpretations: Past and Future. CoRR abs/1410.4364 (2014) - [i6]Paulo Oliva, Thomas Powell:
Bar recursion over finite partial functions. CoRR abs/1410.6361 (2014) - 2013
- [j18]Rob Arthan, Ursula Martin, Paulo Oliva:
A Hoare logic for linear systems. Formal Aspects Comput. 25(3): 345-363 (2013) - [c15]Rob Arthan, Paulo Oliva:
(Dual) Hoops Have Unique Halving. Automated Reasoning and Mathematics 2013: 165-180 - 2012
- [j17]Martín Hötzel Escardó, Paulo Oliva:
The Peirce translation. Ann. Pure Appl. Log. 163(6): 681-692 (2012) - [j16]Gilda Ferreira, Paulo Oliva:
On bounded functional interpretations. Ann. Pure Appl. Log. 163(8): 1030-1049 (2012) - [j15]Paulo Oliva:
Hybrid Functional Interpretations of Linear and Intuitionistic Logic. J. Log. Comput. 22(2): 305-328 (2012) - [j14]Paulo Oliva, Thomas Powell:
On Spector's bar recursion. Math. Log. Q. 58(4-5): 356-265 (2012) - [c14]Martín Hötzel Escardó, Paulo Oliva:
Computing Nash Equilibria of Unbounded Games. Turing-100 2012: 53-65 - [i5]Rob Arthan, Paulo Oliva:
(Dual) Hoops Have Unique Halving. CoRR abs/1203.0436 (2012) - [i4]Paulo Oliva, Thomas Powell:
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis. CoRR abs/1204.5244 (2012) - [i3]Paulo Oliva, Thomas Powell:
A Constructive Interpretation of Ramsey's Theorem via the Product of Selection Functions. CoRR abs/1204.5631 (2012) - 2011
- [j13]Gilda Ferreira, Paulo Oliva:
Functional Interpretations of Intuitionistic Linear Logic. Log. Methods Comput. Sci. 7(1) (2011) - [c13]Martín Hötzel Escardó, Paulo Oliva, Thomas Powell:
System T and the Product of Selection Functions. CSL 2011: 233-247 - 2010
- [j12]Paulo Oliva:
Functional interpretations of linear and intuitionistic logic. Inf. Comput. 208(5): 565-577 (2010) - [j11]Gilda Ferreira, Paulo Oliva:
Confined modified realizability. Math. Log. Q. 56(1): 13-28 (2010) - [j10]Jaime Gaspar, Paulo Oliva:
Proof interpretations with truth. Math. Log. Q. 56(6): 591-610 (2010) - [j9]Martín Hötzel Escardó, Paulo Oliva:
Selection functions, bar recursion and backward induction. Math. Struct. Comput. Sci. 20(2): 127-168 (2010) - [c12]Martín Hötzel Escardó, Paulo Oliva:
Computational Interpretations of Analysis via Products of Selection Functions. CiE 2010: 141-150 - [c11]Martín Hötzel Escardó, Paulo Oliva:
The Peirce Translation and the Double Negation Shift. CiE 2010: 151-161 - [c10]Martín Escardó, Paulo Oliva:
What Sequential Games, the Tychonoff Theorem and the Double-Negation Shift Have in Common. MSFP@ICFP 2010: 21-32 - [c9]Gilda Ferreira, Paulo Oliva:
On Various Negative Translations. CL&C 2010: 21-33
2000 – 2009
- 2009
- [j8]Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
A general framework for sound and complete Floyd-Hoare logics. ACM Trans. Comput. Log. 11(1): 7:1-7:31 (2009) - [c8]Gilda Ferreira, Paulo Oliva:
Functional Interpretations of Intuitionistic Linear Logic. CSL 2009: 3-19 - 2008
- [j7]Paulo Oliva, Thomas Streicher:
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic. Fundam. Informaticae 84(2): 207-220 (2008) - [c7]Mircea-Dan Hernest, Paulo Oliva:
Hybrid Functional Interpretations. CiE 2008: 251-260 - [i2]Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
A General Framework for Sound and Complete Floyd-Hoare Logics. CoRR abs/0807.1016 (2008) - 2007
- [j6]Fernando Ferreira, Paulo Oliva:
Bounded functional interpretation and feasible analysis. Ann. Pure Appl. Log. 145(2): 115-129 (2007) - [c6]Paulo Oliva:
Modified Realizability Interpretation of Classical Linear Logic. LICS 2007: 431-442 - [c5]Paulo Oliva:
Computational Interpretations of Classical Linear Logic. WoLLIC 2007: 285-296 - 2006
- [j5]Ulrich Berger, Paulo Oliva:
Modified bar recursion. Math. Struct. Comput. Sci. 16(2): 163-183 (2006) - [j4]Paulo Oliva:
Unifying Functional Interpretations. Notre Dame J. Formal Log. 47(2): 263-290 (2006) - [c4]Paulo Oliva:
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis. CiE 2006: 423-434 - [c3]Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
Hoare Logic in the Abstract. CSL 2006: 501-515 - 2005
- [j3]Fernando Ferreira, Paulo Oliva:
Bounded functional interpretation. Ann. Pure Appl. Log. 135(1-3): 73-112 (2005) - [i1]Paulo Oliva:
Unifying Functional Interpretations. Mathematics, Algorithms, Proofs 2005 - 2003
- [j2]Ulrich Kohlenbach, Paulo Oliva:
Proof mining in L1-approximation. Ann. Pure Appl. Log. 121(1): 1-38 (2003) - [c2]Paulo Oliva:
Polynomial-time Algorithms from Ineffective Proofs. LICS 2003: 128-137 - 2002
- [j1]Paulo Oliva:
On the Computational Complexity of Best L1-approximation. Math. Log. Q. 48(S1): 66-77 (2002)
1990 – 1999
- 1998
- [c1]Eugene W. Myers, Paulo Oliva, Katia S. Guimarães:
Reporting Exact and Approximate Regular Expression Matches. CPM 1998: 91-103
Coauthor Index
aka: Martín Escardó
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint