Chapter VI Realizability

Studies in Logic and the Foundations of Mathematics

Volumn 137, Issue C, 1998, Pages 407-473

  Troelstra, A S ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009921392     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(98)80021-9     Document Type: Chapter

References (222)

1. Aczel P.H.G. Saturated intuitionistic theories. In: Schmidt H., Schütte K., and Thiele H. (Eds). Contributions to Mathematical Logic (1968), North-Holland, Amsterdam 1-11
2. Aczel P.H.G. A note on interpreting intuitionistic higher-order logic. Handwritten note (1980)
3. Barbanera F., and Martini S. Proof-functional connectives and realizability. Archive for Mathematical Logic 33 (1994) 189-211
4. Barendregt H.P. Combinatory logic and the axiom of choice. Indagationes Mathematicae 35 (1973) 203-221
5. In: Barwise J., Keisler H.J., and Kunen K. (Eds). The Kleene Symposium (1980), North-Holland, Amsterdam
6. Beeson M.J. The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations. JSL 41 (1975) 321-346
7. Beeson M.J. Derived rules of inference related to the continuity of effective operations. JSL 41 (1976) 328-336
8. Beeson M.J. The unprovability in intuitionistic formal systems of the continuity of effective operations on the reals. JSL 41 (1976) 18-24
9. Beeson M.J. Continuity and comprehension in intuitionistic formal systems. Pacific Journal of Mathematics 68 (1977) 29-40
10. Beeson M.J. Principles of continuous choice and continuity of functions in formal systems for constructive mathematics. AML 12 (1977) 249-322
11. Beeson M.J. Continuity in intuitionistic set theories. In: Boffa M., van Dalen D., and McAloon K. (Eds). Logic Colloquium '78 (1979), North-Holland, Amsterdam 1-52
12. Beeson M.J. Goodman's theorem and beyond. Pacific Journal of Mathematics 84 (1979) 1-28
13. Beeson M.J. Extensionality and choice in constructive mathematics. Pacific Journal of Mathematics 88 (1980) 1-28
14. Beeson M.J. Formalizing constructive mathematics: Why and how?. In: Richman F. (Ed). Constructive mathematics (1981), Springer Verlag, Berlin, Heidelberg, New York 146-190
15. Beeson M.J. Recursive models for constructive set theories. APAL 23 (1982) 127-178
16. Beeson M.J. Foundations of constructive mathematics (1985), Springer Verlag, Berlin, Heidelberg, New York
17. Beeson M.J., and Scedrov A. Church's thesis, continuity and set theory. JSL 49 (1984) 630-643
18. Berardi S., Bezem M., and Coquand T. On the computational content of the Axiom of Choice. Tech. Rep. Logic Group Preprint Series (1994), Department of Philosophy, Utrecht University 116
19. Berger U., and Schwichtenberg H. Program extraction from classical proofs. In: Leivant D. (Ed). Logic and Computaional Complexity. International Workshop LCC '94, Indianapolis, IN, USA october 1994. Lecture Notes in Computer Science 960 (1995), Springer Verlag, Berlin, Heidelberg, New York 77-97
20. To appear in. Berger U., Schwichtenberg H., and Seisenberger M. From proofs to programs in the Minlog system. The Warshall algorithm and Higman's lemma. Journal of Automated Reasoning (1997)
21. Bezem M. Strongly majorizable functionals of finite type: a model for bar recursion containing discontinuous functionals. JSL 50 (1985) 652-660
22. Bezem M. Bar Recursion and Functionals of finite Type. PhD thesis (1986), Rijksuniversiteit Utrecht
23. Bezem M. Compact and majorizable functionals of finite type. JSL 54 (1989) 271-280
24. Buchholz W., Feferman S., Pohlers W., and Sieg W. Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies (1981), Springer Verlag, Berlin, Heidelberg, New York
25. Buss S.R. The polynomial hierarchy and intuitionistic bounded arithmetic. Structure in Complexity Theory. Springer Lecture Notes in Computer Science 223 (1986), Springer Verlag, Berlin, Heidelberg, New York 77-103
26. Carboni A., Freyd P.J., and Scedrov A. A categorical approach to realizability and polymorphic types. In: Main M., Melton M., Mislove A., and Schmidt D. (Eds). Mathematical Foundations of Programming Language Semantics (1988), Springer Verlag, Berlin, Heidelberg, New York 23-42
27. Carboni A., Freyd P.J., and Scedrov A. Proceedings of the 3rd workshop. Tulane University, New Orleans, Louisiana, U.S.A. Lecture Notes in Computer Science (April 1987) 298
28. Cellucci C. Operazioni di Brouwer e realizzabilita formalizzata (English summary). Annali della Scuola Normale Superiore di Pisa. Classe di Science. Fisiche e Matiche, Seria III 25 (1971) 649-682
29. The preprint dates from 1991. Cook S.A., and Urquhart A. Functional interpretations of feasibly constructive arithmetic. APAL 63 (1993) 103-200
30. Damnjanovic Z. Strictly primitive recursive realizability, I. JSL 59 (1994) 1210-1227
31. Damnjanovic Z. Minimal realizability of intuitionistic arithmetic and elementary analysis. JSL 60 (1995) 1208-1241
32. Submitted to. Damnjanovic Z. Elementary realizability. Journal of Philosophical Logic (1996)
33. Diller J. Functional interpretations of Heyting's arithmetic in all finite types. Nieuw Archief voor Wiskunde. Derde Serie 27 (1979) 70-97
34. Diller J. Modified realization and the formulae-as-types notion. In: Seldin J.P., and Hindley J.R. (Eds). To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (1980), Academic Press, New York 491-501
35. Diller J., and Nahm W. Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen. Archiv 16 (1974) 49-66
36. Translation, Seminars in Mathematics. V.A. Steklov Mathematical Institute Leningrad 8 (1970), pp. 13-18. This volume appeared as. Dragalin A.G. The computability of primitive recursive terms of finite type, and primitive recursive realization (Russian). Zapiski 8 (1968) 32-45
37. Dragalin A.G. The computability of primitive recursive terms of finite type, and primitive recursive realization (Russian). In: Slisenko A.O. (Ed). Studies in Constructive Mathematics and Mathematical Logic. Part II (1968), Consultants Bureau, New York, London
38. Translation SM 10, pp. 1417-1420. Dragalin A.G. Transfinite completions of constructive arithmetical calculus (Russian). Doklady 189 (1969) 458-460
39. Dragalin A.G. An algebraic approach to intuitionistic models of the realizability type (Russian). In: Mikhajlov A.I., et al. (Ed). Issledovaniya po Neklassicheskim Logikam i Teorii Mnozhestv ((Investigations on Non-Classical Logics and Set Theory)) (1979), Nauka, Moskva 83-201
40. Translation SM 21, pp. 461-464. Dragalin A.G. New forms of realizability and Markov's rule (Russian). Doklady 251 (1980) 534-537
41. Translation of the Russian original from 1979. Dragalin A.G. Mathematical Intuitionism (1988), American Mathematical Society, Providence, Rhode Island
42. 0 und vergleichbare Theorien im Verhältnis zur Heyting-Arithmetik. PhD thesis (1987), Ludwig-Maximilians-Universität, München
43. Feferman S. A language and axioms for explicit mathematics. In: Crossley J.N. (Ed). Algebra and Logic (1975), Springer Verlag, Berlin, Heidelberg, New York 87-139
44. Feferman S. Constructive theories of functions and classes. In: Boffa M., van Dalen D., and McAloon K. (Eds). Logic Colloquium '78 (1979), North-Holland, Amsterdam 159-224
45. Ferreira F., and Marques A. Extracting algorithms from intuitionistic proofs. Tech. Rep. Pré-publicações de Matemática 26/96 (1996), Universidade de Lisboa
46. Fourman M.P., and Scott D.S. Sheaves and logic. In: Fourman M.P., Mulvey C.J., and Scott D.S. (Eds). Applications of Sheaves (1979), Springer Verlag, Berlin, Heidelberg, New York 302-401
47. H. M. Friedman [1973] Some applications of Kleene's methods for intuitionistic systems, in: Mathias and Rogers [1973], pp. 113-170.
48. Friedman H.M. The disjunction property implies the numerical existence property. Proceedings of the National Academy of Sciences of the United States of America 72 (1975) 2877-2878
49. Friedman H.M. On the derivability of instantiation properties. JSL 42 (1977) 506-514
50. Friedman H.M. Set theoretic foundations of constructive analysis. Annals of Mathematics, Series 2 105 (1977) 1-28
51. Corrigendum in APAL 26 (1984) p. 101. Friedman H.M., and Scedrov A. Set existence property for intuitionistic theories with dependent choice. APAL 25 (1983) 129-140
52. Friedman H.M., and Scedrov A. Large sets in intuitionistic set theory. APAL 27 (1984) 1-24
53. Friedman H.M., and Scedrov A. Intuitionistically provable recursive well-orderings. APAL 30 (1986) 165-171
54. Gallier J.H. Proving properties of typed lambda-terms using realizability, covers, and sheaves. Tech. Rep. MS-CIS-93-91 (1993), Computer and Information Science Department, School of Engineering and Applied Science, University of Pennsylvania, Philadelphia
55. Translation SM 23, pp. 9-14. Gavrilenko Yu.V. Recursive realizability from the intuitionistic point of view (Russian). Doklady 256 (1981) 18-22
56. Girard J.Y., Lafont Y., and Taylor P. Proofs and Types (1988), Cambridge University Press, Cambridge, U.K.
57. Gödel K. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12 (1958) 280-287
58. Gödel K. Collected Works Volume 2 (1990), Oxford University Press, Oxford
59. Goodman N.D. Relativized realizability in intuitionistic arithmetic of all finite types. JSL 43 (1978) 23-44
60. Grayson R.J. Derived rules obtained by a model-theoretic approach to realisability. Handwritten notes from Münster University (1981)
61. Grayson R.J. Modified realisability toposes. Handwritten notes from Münster University (1981)
62. Grayson R.J. Note on extensional realizability. Handwritten notes from Münster University (1981)
63. Grayson R.J. Appendix to modified realisability toposes. Handwritten notes from Münster University (1982)
64. Harnik V. Provably total functions of intuitionistic bounded arithmetic. JSL 57 (1992) 466-477
65. Harnik V., and Makkai M. Lambek's categorical proof theory and Läuchli's abstract realizability. JSL 57 (1992) 200-230
66. In: Heyting A. (Ed). Constructivity in Mathematics (1959), North-Holland, Amsterdam
67. Howard W.A. Appendix: Hereditarily majorizable functionals of finite type. Troelstra [1973a] (1973), Springer Verlag, Berlin, Heidelberg, New York 454-461
68. Hyland J.M.E. The effective topos. In: Troelstra A.S., and van Dalen D. (Eds). The L.E.J. Brouwer Centenary Symposium (1983), North-Holland, Amsterdam 165-216
69. Hyland J.M.E. A small complete category. APAL 40 (1988) 135-165
70. Hyland J.M.E., Johnstone P.T., and Pitts A.M. Tripos theory. Mathematical Proceedings of the Cambridge Philosophical Society 88 (1980) 205-232
71. Hyland J.M.E., and Ong C.-H.L. Modified realizability toposes and strong normalization proofs. In: Bezem M., and Groote J.F. (Eds). Typed Lambda Calculi and Applications (1993), Springer Verlag, Berlin, Heidelberg, New York 179-194
72. Hyland J.M.E., Robinson E., and Rosolini G. The discrete objects in the effective topos. Proceedings of the London Mathematical Society 60 (1990) 1-36
73. Translation SM 4(pp. 1146-1148). Jankov V.A. Realizable formulas of propositional logic (Russian). Doklady 151 (1963) 1035-1037
74. de Jongh D.H.J. Investigations on the intuitionistic propositional calculus. PhD thesis (1968), University of Wisconsin, Madison
75. D. H. J. de Jongh [1970] A characterization of the intuitionistic propositional calculus, in: Kino, Myhill and Vesley [1970], pp. 211-217.
76. D. H. J. de Jongh [1980] Formulas of one propositional variable in intuitionistic arithmetic, in: Troelstra and van Dalen [1980], pp. 51-64.
77. Joyal A., and Moerdijk I. Algebraic Set Theory. London Mathematical Society Lecture Series 220 (1995), Cambridge University Press, Cambridge, U.K.
78. Kabakov F.A. On the derivability of some realizable formulae of the sentential calculus (Russian). ZMLG 9 (1963) 97-104
79. Translation SM 11, pp. 612-614. Kabakov F.A. Intuitionistic deducibility of some realizable formulae of propositional logic (Russian). Doklady 192 (1970) 269-271
80. Translation SM 11, pp. 562-564. Kabakov F.A. On modelling of pseudo-boolean algebras by realizability (Russian). Doklady 192 (1970) 16-18
81. Not seen. Found in another bibliography and included for completeness. Khakhanyan V.Kh. Consistency of the intuitionistic set theory with Brouwer's principle. Matematika 5 (1979)
82. Translation SM 21, pp. 894-898. Khakhanyan V.Kh. Comparative strength of variants of Church's thesis at the level of set theory (Russian). Doklady 252 (1980) 1070-1074
83. Translation Moscow University Mathematics Bulletin 35/5, pp. 3-7. Khakhanyan V.Kh. The consistency of intuitionistic set theory with Church's principle and the uniformization principle (Russian). Vestnik Moskovskogo Universiteta. Seriya. I. Matematika, Mekhanika 1980/5 (1980) 3-7
84. Translation SM 22, pp. 46-50. Khakhanyan V.Kh. The consistency of intuitionistic set theory with formal mathematical analysis (Russian). Doklady 253 (1980) 48-52
85. Khakhanyan V.Kh. The consistency of some intuitionistic and constructive principles with a set theory. Studia Logica 40 (1981) 237-248
86. Khakhanyan V.Kh. Set theory and Church's thesis (Russian). In: Mikhajlov A.I. (Ed). Issledovaniya po Neklascheskims Logikam i Formal'nym Sistemam (Studies in Nonclassical logics and Formal Systems) (1983), Nauka, Moskva 198-208
87. Khakhanyan V.Kh. Nonderivability of the uniformization principle from Church's thesis (Russian). Matematicheskie Zametki 43 (1988) 685-691
88. Translation Mathematical Notes 43, pp. 394-398. Khakhanyan V.Kh. Nonderivability of the uniformization principle from Church's thesis (Russian). Matematicheskie Zametki 43 (1988) 703
89. In: Kino A., Myhill J., and Vesley R.E. (Eds). Intuitionism and Proof Theory (1970), North-Holland, Amsterdam
90. Translation Seminars in Mathematics. V.A. Steklov Mathematical Institute Leningrad 8 (1970), pp. 22-27. This volume appeared as:. Kipnis M.M. The constructive classification of arithmetic predicates and the semantic bases of arithmetic (Russian). Zapiski 8 (1968) 53-65
91. In: Slisenko A.O. (Ed). Studies in Constructive Mathematics and Mathematical Logic. Part II (1968), Consultants Bureau, New York, London
92. Translation Journal of Soviet Mathematics 1 (1973), pp. 22-27. Kipnis M.M. On the realizations of predicate formulas (Russian) (English summary). Zapiski 20 (1971) 40-48
93. Kleene S.C. On the interpretation of intuitionistic number theory. JSL 10 (1945) 109-124
94. Co-publisher: Wolters-Noordhoff;. Kleene S.C. Introduction to metamathematics. 8th revised ed. 1980 (1952), North-Holland, Amsterdam
95. Also in. Kleene S.C. Realizability. Errata in Kleene and Vesley [1965], page 192. Summaries of Talks presented at the Summer Institute for Symbolic Logic. Institute for Defense Analyses, Communications Research Division, Princeton. Heyting [1959] (1957) 285-289
96. Kleene S.C. Realizability and Shanin's algorithm for the constructive deciphering of mathematical sentences. Logique et Analyse, Nouvelle Série 3 (1960) 154-165
97. Addenda in. Kleene S.C. Disjunction and existence under implication in elementary intuitionistic formalisms. JSL 27 (1962) 11-18
98. Kleene S.C. Disjunction and existence under implication in elementary intuitionistic formalisms. JSL 28 (1963) 154-156
99. Kleene S.C. Classical extensions of intuitionistic mathematics. In: Bar-Hillel Y. (Ed). LMPS 2 (1965), North-Holland, Amsterdam 31-44
100. Kleene S.C. Logical calculus and realizability. Acta Philosophica Fennica 18 (1965) 71-80
101. Kleene S.C. Constructive functions. In: van Rootselaar B., and Staal J.F. (Eds). The Foundations of Intuitionistic Mathematics. LMPS 3 (1968), North-Holland, Amsterdam 137-144
102. Kleene S.C. Formalized recursive functionals and formalized realizability. vol. 89 of Memoirs of the American Mathematical Society (1969), American Mathematical Society, Providence, Rhode Island
103. S. C. Kleene [1973] Realizability: a retrospective survey, in Mathias and Rogers [1973], pp. 95-112.
104. Kleene S.C., and Vesley R.E. The foundations of intuitionistic mathematics, especially in relation to recursive functions (1965), North-Holland, Amsterdam
105. Kobayashi S., and Tatsuta M. Realizability interpretation of generalized inductive definitions. Theoretical Computer Science 131 (1994) 121-138
106. Kohlenbach U.W. Theorie der majorisierbaren und stetigen Funktionale und ihre Anwendung bei der Extraktion von Schranken aus inkonstruktiven Beweisen: effektive Eindeutigkeitsmodule bei besten Approximationen aus ineffektiven Eindeutigkeitsbeweisen. PhD thesis (1990), J.W. Geothe-Universität, Frankfurt am Main
107. Kohlenbach U.W. Pointwise hereditary majorization and some applications. Archive for Mathematical Logic 31 (1992) 227-241
108. Kreisel G. A variant to Hilbert's theory of the foundations of arithmetic. British Journal for the Philosophy of Science 4 (1953) 107-127
109. G. Kreisel [1959] Interpretation of analysis by means of constructive functionals of finite types, in: Heyting [1959], pp. 101-128.
110. Kreisel G. Foundations of intuitionstic logic. In: Nagel E., Suppes P., and Tarski A. (Eds). LMPS (1962), Stanford University Press, Stanford 198-210
111. Kreisel G. On weak completeness of intuitionistic predicate logic. JSL 27 (1962) 139-158
112. Addendum in APAL 3, pp. 437-439. Kreisel G., and Troelstra A.S. Formal systems for some branches of intuitionistic analysis. APAL 1 (1970) 229-387
113. Translation SM 18, pp. 755-758. Krol' M.D. Disjunctive and existential properties of intuitionistic analysis with Kripke's scheme (Russian). Doklady 234 (1977)
114. Translation SM 28, pp. 27-30. Troelstra A.S. Various forms of the continuity principle (Russian). Doklady 271 (1983) 33-36
115. Troelstra A.S. On a version of realizability (Russian). XI Interrepublican Conference on Mathematical Logic. University of Kazan, October 6-8, 1992 (1992) 81
116. Kurtz S.A., Mitchell J.C., and O'Donnell M.J. Connecting formal semantics to constructive intuitions. Tech. Rep. CS 92-01 (1992), Department of Computer Science, University of Chicago
117. Lambek J., and Scott P.J. Introduction to Higher Order Categorical Logic (1986), Cambridge University Press, Cambridge
118. Läuchli H. An abstract notion of realizability for which intuitionistic predicate calculus is complete. In: Kino A., Myhill J., and Vesley R.E. (Eds). Intuitionism and Proof Theory (1970), North-Holland, Amsterdam 227-234
119. 0 . Proceedings of the American Mathematical Society 73 (1979) 101-106
120. Lifschitz V. Constructive assertions in an extension of classical mathematics. JSL 47 (1982) 359-387
121. Lifschitz V. Calculable natural numbers. In: Shapiro S. (Ed). Intensional Mathematics (1985), North-Holland, Amsterdam 173-190
122. Also as a. Lipton J. Constructive Kripke semantics and realizability. In: Moschovakis Y.N. (Ed). Logic from Computer Science. Technical Report, from Cornell University, nr. 90-71 (1990), Springer Verlag, Berlin, Heidelberg, New York
123. Lipton J., and O'Donnell M.J. Some intuitions behind realizability semantics for constructive logic: tableaux and Läuchli countermodels. APAL 81 (1996) 187-239
124. Translation SM 20, pp. 394-398. Maksimova L.L., Shekhtman V.B., and Skvortsov D.P. The impossibility of a finite axiomatization of Medvedev's logic of finitary problems (Russian). Doklady 245 (1979) 1051-1054
125. Martin-Löf P. Constructive methematics and computer programming. In: Cohen L.J., Loś J., Pfeiffer H., and Podewski K.-P. (Eds). LMPS 6 (1982), North-Holland, Amsterdam 153-175
126. Martin-Löf P. Intuitionistic type theory. Notes by Giovanni Sambin of a series of lectures given in Padua, June 1980 (1984), Bibliopolis, Napoli
127. Mathias A.R.D., and Rogers H. Cambridge Summer School in Mathematical Logic (1973), Springer Verlag, Berlin, Heidelberg, New York
128. McCarty D.C. Information systems, continuity and realizability. In: Clarke E., and Kozen D. (Eds). Logics of Programs. vol. 164 of Lecture Notes in Computer Science (1984), Springer Verlag, Berlin, Heidelberg, New York 341-359
129. McCarty D.C. Realizability and Recursive Mathematics. Tech. Rep. CMU-CS-84-131. Report version of the author's PhD thesis, Oxford University 1983 (1984), Department of Computer Science, Carnegie-Mellon University
130. McCarty D.C. Subcountability under realizability. The Notre Dame Journal of Formal Logic 27 (1986) 210-220
131. McCarty D.C. Markov's principle, isols and Dedekind finite sets. JSL 53 (1988) 1042-1069
132. McCarty D.C. Polymorphism and apartness. The Notre Dame Journal of Formal Logic 32 (1991) 513-532
133. Translation SM 3, pp. 227-230. Medvedev Yu.T. Finite problems (Russian). Doklady 142 (1962) 1015-1018
134. Translation SM 4, pp. 180-183. Medvedev Yu.T. Interpretation of logical formulae by means of finite problems and its relation to the realizability theory (Russian). Doklady 148 (1963) 771-774
135. Translation SM 7, pp. 857-860. Medvedev Yu.T. Interpretation of logical formulae by means of finite problems (Russian). Doklady 169 (1966) 20-23
136. Errata. Medvedev Yu.T. Locally finitary algorithmic problems (Russian). Doklady 203 (1972) 285-288
137. Translation, SM 13, pp. 382-386. Medvedev Yu.T. Locally finitary algorithmic problems (Russian). Doklady 204 (1972) 1286
138. Medvedev Yu.T. An interpretation of intuitionistic number theory. In: Suppes P., Moisil G.C., and Joja A. (Eds). LMPS 4 (1973), North-Holland, Amsterdam 129-136
139. Mints G.E. The completeness of provable realizability. The Notre Dame Journal of Formal Logic 30 (1989) 420-441
140. Moschovakis J.R. Disjunction and existence in formalized intuitionistic analysis. In: Crossley J.N. (Ed). Sets, Models, and Recursion Theory (1967), North-Holland, Amsterdam 309-331
141. Moschovakis J.R. Can there be no nonrecursive functions?. JSL 36 (1971) 309-315
142. Moschovakis J.R. A topological interpretation of second-order intuitionistic arithmetic. Compositio mathematica 26 (1973) 261-275
143. J. R. Moschovakis [1980] Kleene's realizability and "divides" notions for formalized intuitionistic mathematics, in: Barwise, Keisler and Kunen [1980], pp. 167-179.
144. Moschovakis J.R. A disjunctive decomposition theorem for classical theories. In: Richman F. (Ed). Constructive Mathematics (1981), Springer Verlag, Berlin, Heidelberg, New York 250-259
145. Moschovakis J.R. An intuitionistic theory of lawlike, choice and lawless sequences. Logic Colloquium '90. Lecture Notes in Logic 2 (1993), Springer Verlag, Berlin, Heidelberg, New York 191-209
146. Moschovakis J.R. More about relatively lawless sequences. JSL 59 (1994) 813-829
147. Moschovakis J.R. A classical view of the intuitionistic continuum. APAL 81 (1996) 9-24
148. Myhill J. A note on indicator-functions. Proceedings of the American Mathematical Society 29 (1973) 181-183
149. J. Myhill [1973b] Some properties of intuitionistic Zermelo-Fraenkel set theory, in: Mathias and Rogers [1973], pp. 206-231.
150. Myhill J. Constructive set theory. JSL 40 (1975) 347-382
151. Nelson D. Recursive functions and intuitionistic number theory. Transactions of the American Mathematical Society 61 (1947) 307-368,556
152. van Oosten J. Lifschitz' realizability. JSL 55 (1990) 805-821
153. van Oosten J. Exercises in Realizability. PhD thesis (1991), Universiteit van Amsterdam
154. van Oosten J. Extension of Lifschitz' realizability to higher order arithmetic, and a solution to a problem of F. Richman. JSL 56 (1991) 964-973
155. van Oosten J. A semantical proof of De Jongh's theorem. Archive for Mathematical Logic (1991) 105-114
156. Submitted to APAL. van Oosten J. Extensional realizability. Tech. Rep. ML-93-18 (1993), Institute for Logic, Language and Computation, University of Amsterdam
157. van Oosten J. Axiomatizing higher-order Kleene realizability. APAL 70 (1994) 87-111
158. van Oosten J. Two remarks on the Lifschitz realizability topos. JSL 61 (1996) 70-79
159. Phoa W. Relative computability in the effective topos. Mathematical Proceedings of the Cambridge Philosophical Society 106 (1989) 419-420
160. Pitts A.M. The Theory of Toposes. PhD thesis (1981), University of Cambridge
161. Translation SM 14, pp. 1420-1424. Plisko V.E. On realizable predicate formulae (Russian). Doklady 212 (1973) 553-556
162. Plisko V.E. A certain formal system that is connected with realizability (Russian). In: Kushner B., and Nagornyi N.M. (Eds). Teoriya Algorifmov i Matematicheskaya Logika: Sbornik Statej (Theory of Algorithms and Mathematical Logic. Collection of articles dedicated to Andrej Andrejevich Markov) (1974), Vychislitel'nyj Tsentr Akademii Nauk SSSR 148-158,215
163. Plisko V.E. On interpretations of predicate formulae that are connected with constructive logic (Russian). 3 Vsesoyuznaya Konferentsiya po Matematicheskoj Logike. Tezitsy Doklady i Soobshcheniya (3rd All-Union Conference on Mathematical Logic) (1974) 170-172
164. Translation SM 15, pp. 193-197. Plisko V.E. Recursive realizability and constructive predicate logic (Russian). Doklady 214 (1974) 520-523
165. Translation SM 17, pp. 59-63. Plisko V.E. Some variants of the notion of realizability for predicate formulas (Russian). Doklady 226 (1976) 61-64
166. Translation Math. Izv. 11, pp. 453-471. Plisko V.E. The nonarithmeticity of the class of realizable predicate formulas (Russian). Izv. Akad. Nauk. 41 (1977) 483-502
167. Translation Math. Izv. 12, pp. 588-604. Plisko V.E. Some variants of the notion of realizability for predicate formulas (Russian). Izv. Akad. Nauk. 42 (1978) 637-653
168. Translation Math. Izv. 22, pp. 291-308. Plisko V.E. Absolute realizability of predicate formulas (Russian). Izv. Akad. Nauk. 47 (1983) 315-334
169. Translated in Moscow University Mathematics Bulletin, 47 (1992), 41-42. Plisko V.E. On the concept of relatively uniform realizability of propositional formulas (Russian). Vestnik Moskovskogo Universiteta Seriya I. Mathematika, Mekhanika (1992) 77-79
170. Renardel de Lavalette G.R. Theories with type-free application and extended bar induction. PhD thesis (1984), Universiteit van Amsterdam
171. Renardel de Lavalette G.R. Extended bar induction in applicative theories. APAL 50 (1990) 139-189
172. Robinson E., and Rosolini G. Colimit completions and the effective topos. JSL 55 (1990) 678-699
173. Robinson T.T. Interpretations of Kleene's metamathematical predicate τ/A in intuitionistic arithmetic. JSL 30 (1965) 140-154
174. Rose G.F. Propositional calculus and realizibility. Transactions of the American Mathematical Society 75 (1953) 1-19
175. Rosolini G. About modest sets. International Journal of Foundations of Computer Science 1 (1990) 341-353
176. Scarpellini B. A model for intuitionistic analysis. Commentarii Mathematici Helvetici 45 (1970) 440-471
177. Scarpellini B. A new realizability notion for intuitionistic analysis. ZLGM 23 (1977) 137-167
178. Scedrov A. Differential equations in constructive analysis and in the recursive realizability topos. Journal of Pure and Applied Algebra 33 (1984) 69-80
179. Scarpellini B. On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis. APAL 32 (1986) 291-297
180. Scarpellini B. Recursive realizability semantics for Calculus of Constructions. Preliminary report. In: Huet G. (Ed). Logical Foundations of Functional Programming (1990), Addison-Wesley Publishing Company 419-430
181. A. Scedrov and P. J. Scott [1982] A note on the Friedman slash and Freyd covers, in: Troelstra and van Dalen [1980], pp. 443-452
182. Scedrov A., and Vesley R.E. On a weakening of Markov's principle. Archiv 23 (1983) 153-160
183. Scott D.S. Extending the topological interpretation to intuitionistic analysis. Compositio Mathematica 20 (1968) 194-210
184. Scowcroft P. The disjunction and numerical existence properties for intuitionistic analysis. In: Crossley J.N., Remmel J.B., Shore R.A., and Sweedler M.E. (Eds). Logical Methods (1993), Birkhaüser Boston, Inc., Boston MA 747-781
185. Translation AMS Transl. 23, pp. 108-189. Shanin N.A. On the constructive interpretation of mathematical judgements (Russian). Trudy Ordena Lenina Matematicheskogo Instituta imeni V. A. Steklova. Akademiya Nauk SSSR 52 (1958) 226-311
186. Shanin N.A. Über einen Algorithmus zur konstruktiven Dechiffrierung mathematischer Urteile (Russian) (German summary). ZLGM 4 (1958) 293-303
187. Translation AMS Transl. 99, pp. 233-275. Shanin N.A. Concerning the constructive interpretation of auxiliary, formulas I (Russian). Trudy Ordena Lenina Matematicheskogo Instituta imeni V. A. Steklova. Akademiya Nauk SSSR 72 (1964) 348-379
188. J. M. Smith [1993] An interpretation of Kleene's slash in type theory, in: Logical Environments, G. Huet and G. Plotkin, eds., pp. 189-197.
189. J. Staples [1973] Combinator realizability of constructive finite type analysis, in: Mathias and Rogers [1973], pp. 253-273.
190. Staples J. Combinator realizability of constructive Morse theory. JSL 39 (1974) 226-234
191. Stein M. Interpretationen der Heyting-Artithmetik endlicher Typen. Archiv 19 (1979) 175-189
192. Stein M. Interpretations of Heyting's arithmetic-An analysis by means of a language with set symbols. AML 19 (1980) 1-31
193. Stein M. A general theorem on existence theorems. ZLGM 27 (1981) 435-452
194. Strahm T. Partial applicative theories and explicit substitutions. Tech. Rep. IAM 93-008 (1993), Institut für Informatik und angewandte Mathematik, Universität Bern
195. Streicher T. Mathematical Independencies in the Pure Calculus of Constructions. Tech. Rep. MIP-909 (1991), Fakultät für Mathematik und Informatik, Universität Passau
196. Swaen M.D.G. Weak and Strong Sum-Elimination in Intuitionistic Type Theory. PhD thesis (1989), Universiteit van Amsterdam
197. Troelstra A.S. The logic of first-order intuitionistic type theory with weak sigma-elimination. JSL 56 (1991) 467-483
198. Troelstra A.S. A characterization of ML in many-sorted arithmetic with conditional application. JSL 57 (1992) 924-953
199. Tait W.W. A realizability interpretation of the theory of species. In: Parikh R. (Ed). Logic Colloquium (1975), Springer Verlag, Berlin, Heidelberg, New York 240-251
200. Tatsuta M. Monotone recursive definition of predicates and its realizability interpretation. Proceedings of Theoretical Aspects of Computer Software (1991), Springer Verlag, Berlin, Heidelberg, New York 38-52
201. Tatsuta M. Program synthesis using realizability. Theoretical Computer Science 90 (1991) 309-353
202. Tatsuta M. Realizability interpretation of coinductive definitions and program synthesis with streams. Proceedings of International Conference on Fifth Generation Computer Systems (1992) 666-673
203. Tharp L.H. A quasi-intuitionistic set theory. JSL 36 (1971) 456-460
204. Tompkins R.R. On Kleene's recursive realizability as an interpretation for intuitionistic elementary number theory. Notre Dame Journal of Formal Logic 9 (1968) 289-293
205. Most, but not all, material reappears in Troelstra [1973a]. Troelstra A.S. Computability of terms and notions of realizability for intuitionistic analysis. Tech. Rep. 71-02 (1971), Department of Mathematics, University of Amsterdam
206. Troelstra A.S. Notions of realizability for intuitionistic arithmetic and intuitionistic arithmetic in all finite types. In: Fenstad J.E. (Ed). The Second Scandinavian Logic Symposium (1971), North-Holland, Amsterdam 369-405
207. In: Troelstra A.S. (Ed). Metamathematical investigation of intuitionistic arithmetic and analysis (1973), Springer Verlag, Berlin, Heidelberg, New York
208. A. S. Troelstra [1973b] Notes on intuitionistic second order arithmetic, in: Mathias and Rogers [1973], pp. 171-205.
209. Troelstra A.S. Axioms for intuitionistic mathematics incompatible with classical logic. In: Butts R.E., and Hintikka J. (Eds). LMPS 5 vol. 1 (1977), D. Reidel, Dordrecht and Boston 59-84
210. Troelstra A.S. A note on non-extensional operations in connection with continuity and recursiveness. Indagationes Mathematicae 39 (1977) 455-462
211. Troelstra A.S. Some models for intuitionistic finite type arithmetic with fan functional. JSL 42 (1977) 194-202
212. A. S. Troelstra [1980] Extended bar induction of type zero, in: Barwise, Keisler and Kunen [1980], pp. 277-316.
213. Troelstra A.S. Comparing the theory of representations and constructive mathematics. In: Börger E., Jäger G., Kleine Büning H., and Richter M.M. (Eds). Computer Science Logic. 5th workshop, CSL '91 (1992), Springer Verlag, Berlin, Heidelberg, New York 382-395
214. In: Troelstra A.S., and van Dalen D. (Eds). The L. E. J. Brouwer Centenary Symposium (1980), North-Holland, Amsterdam
215. Troelstra A.S., and van Dalen D. Constructivism in Mathematics 2 volumes (1988), North-Holland, Amsterdam
216. Translation Seminars in Mathematics. V.A. Steklov Mathematical Institute Leningrad 8 (1970), pp. 126-132. This volume appeared as: A.O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic. Part II. Consultants Bureau, New York, London. Tsejtin G.S. The disjunctive rank of the formulas of constructive arithmetic (Russian). Zapiski 8 (1968) 260-271
217. Translation Journal of Soviet Mathematics 1, 1-11 (1973). Varpahovskij F.L. A class of realizable propositional formulas. Zapiski 1 (1971) 8-23
218. R. E. Vesley [1970] A palatable substitute for Kripke's schema, in: Kino, Myhill and Vesley [1970], pp. 197-207.
219. Vesley R.E. Realizing Brouwer's sequences. APAL 81 (1996) 25-74
220. Voronkov A. N-realizability: one more constructive semantics. Tech. Rep. 71 (1991), Department of Mathematics, Monash University, Australia
221. Voronkov A. On completeness of program synthesis systems. In: Börger E., Jäger G., Kleine Büning H., and Richter M.M. (Eds). Computer Science Logic. 5th workshop, CSL '91 (1992), Springer Verlag, Berlin, Heidelberg, New York 411-418
222. 1 -induction. Preprint. Part of the author's dissertation project at he University, of Münster, Westphalia, Germany (1996)