Sciweavers

149 search results - page 2 / 30
» A realizability interpretation for classical analysis
Sort
View
WOLLIC
2007
Springer
14 years 2 days ago
Computational Interpretations of Classical Linear Logic
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...
Paulo Oliva
APAL
2010
123views more  APAL 2010»
13 years 3 months ago
Classical descriptive set theory as a refinement of effective descriptive set theory
The (effective) Suslin-Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it...
Yiannis N. Moschovakis
CIE
2006
Springer
13 years 9 months ago
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
Paulo Oliva
MST
2008
101views more  MST 2008»
13 years 6 months ago
Realizability interpretation of proofs in constructive analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
CIE
2010
Springer
13 years 10 months ago
Computational Interpretations of Analysis via Products of Selection Functions
Abstract. We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to t...
Martín Hötzel Escardó, Paulo Ol...