10 search results - page 1 / 2 » Variations on Realizability: Realizing the Propositional Axi... |
MSCS
2002
13 years 4 months ago
2002
FUIN
2008
13 years 5 months ago
2008
MSCS
2006
13 years 4 months ago
2006
Modified bar recursion has been used to give a realizability interpretation of the classical axioms of countable and dependent choice. In this paper we survey the main results con...
APAL
2010
13 years 5 months ago
2010
We upgrade the light Dialectica interpretation [6] by adding two more light universal quantifiers, which are both semi-computational and semi-uniform and complement each other. An...
FSS
2006
13 years 4 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...