#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1967

2018

- This year (5)
- Last 5 years (16)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paulo Oliva, P. Oliva
- 2010

This article gives an overview of recent work on the theory of selection functions. We explain the intuition behind these higher type objects, and define a general notion of sequential game whose… (More)

We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new information. In this survey paper we discuss, by means of examples from mathematics, some… (More)

- Ulrich Berger, Paulo Oliva
- Mathematical Structures in Computer Science
- 2006

We introduce a variant of Spector’s bar recursion (called “modified bar recursion”) in finite types to give a realizability interpretation of the classical axiom of countable choice allowing for the… (More)

- Martín Hötzel Escardó, Paulo Oliva
- Mathematical Structures in Computer Science
- 2010

• Users may freely distribute the URL that is used to identify this publication. • Users may download and/or print one copy of the publication from the University of Birmingham research portal for… (More)

- Fernando Ferreira, Paulo Oliva
- Ann. Pure Appl. Logic
- 2005

We present a new functional interpretation, based on a novel assignment of formulas. In contrast with Gödel’s functional “Dialectica” interpretation, the new interpretation does not care for precise… (More)

- Mircea-Dan Hernest, Paulo Oliva
- CiE
- 2008

We show how different functional interpretations can be combined via a multi-modal linear logic. A concrete hybrid of Kreisel’s modified realizability and Gödel’s Dialectica is presented, and several… (More)

- Paulo Oliva, Thomas Streicher
- Fundam. Inform.
- 2008

This article investigates Krivine’s realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by presenting a two-step… (More)

- Martín Hötzel Escardó, Paulo Oliva
- Turing-100
- 2012

Using techniques from higher-type computability theory and proof theory we extend the well-known game-theoretic technique of backward induction to certain general classes of unbounded games. The main… (More)

- Martín Hötzel Escardó, Paulo Oliva
- MSFP@ICFP
- 2010

This is a tutorial for mathematically inclined functional programmers, based on previously published, peered reviewed theoretical work. We discuss a higher-type functional, written here in the… (More)

- Paulo Oliva, S C Hammill, William D. Edwards
- Journal of the American College of Cardiology
- 1993

OBJECTIVE
To test the hypothesis that certain clinical events may precede free wall myocardial rupture and allow its prediction, we conducted a retrospective and prospective study of 70 patients with… (More)