Realizability: A historical essay

Mathematical Structures in Computer Science

Volumn 12, Issue 3, 2002, Pages 239-263

  Oosten, Jaap Van ^a  

^a Department of Mathematics ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85011052667     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129502003626     Document Type: Article

References (103)

1. Aczel, P.H.G. (1980) A note on interpreting intuitionistic higher-order logic. (Handwritten note.)
2. Awodey, S. and Birkedal, L. (1999) Elementary axioms for local maps of toposes. Technical Report CMU-PHIL-103, Department of Philosophy, Carnegie Mellon University. (Submitted for publication.)
3. Awodey, S., Birkedal, L. and Scott, D. S. (1999) Local realizability toposes and a modal logic for computability. In: Birkedal, L., van Oosten, J., Rosolini, G. and Scott, D. S. (eds.) Tutorial Workshop on Realizability Semantics, Trento, Italy. Electronic Notes in Computer Science 23, Elsevier.
4. Beeson, M.J. (1975) The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations. Journal of Symbolic Logic 41 321–346.
5. Beeson, M.J. (1979) Goodman’s theorem and beyond. Pacific Journal of Mathematics 84 1–28.
6. Beeson, M.J. (1982) Recursive models for constructive set theories. Annals of Pure and Applied Logic 23 127–178.
7. Beeson, M. J. (1985) Foundations of constructive mathematics, Springer-Yerlag.
8. Bell, J. L. (1977) Boolean-valued models and independence proofs in set theory, Clarendon Press, Oxford.
9. Birkedal, L. (2000) Developing theories of types and computability via realizabil-ity. Electronic Notes in Theoretical Computer Science 34 i—viii 1-282. 1–282. Available at http://www.elsevier.nl/locate/entcs/volume34.html.
10. Birkedal, L., Carboni, A., Rosolini, G. and Scott, D. S. (1998) Type theory via exact categories. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, Indianapolis, Indiana, IEEE Computer Society Press 188–198.
11. Birkedal, L. and van Oosten, J. (2000) Relative and modified relative realizability. Technical Report 1146, Department of Mathematics, Utrecht University. (To appear in: Annals of Pure and Applied Logic 2002.)
12. Carboni, A. (1995) Some free constructions in realizability and proof theory. Journal of Pure and Applied Algebra 103 117–148.
13. Carboni, A., Freyd, P.J. and Scedrov, A. (1988) A categorical approach to realizability and polymorphic types. In: Main, M., Melton, A., Mislove, M. and Schmidt, D. (eds.) Mathematical Foundations of Programming Language Semantics, New Orleans. Springer-Verlag Lecture Notes in Computer Science 298 23–42.
14. Carboni, A., Janelidze, G., Kelly, G. M. and Pare, R. (1997) On localization and stabilization for factorization systems. Appl. Categ. Structures 5 (1) 1–58.
15. Carboni, A. and Celia Magno, R. (1982) The free exact category on a left exact one. Journal of Australian Mathematical Society 33: 295–301.
16. Carboni, A. and Rosolini, G. (2000) Locally cartesian closed exact completions. Journal of Pure and Applied Algebra 154 103–116.
17. Carboni, A. and Vitale, E. M. (1998) Regular and exact completions. Journal of Pure and Applied Algebra 125 79–117.
18. de Jongh, D. H. J. (1969) The maximality of the intuitionistic predicate calculus with respect to Heyting’s arithmetic. (Typed manuscript from University of Winsconsin, Madison.)
19. Diller, J. (1980) Modified realization and the formulae-as-types notion. In: Seldin, J.P. and Hindley, J. R. (eds.) To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalisms, Academic Press 491–501.
20. Diller, J. and Troelstra, A. S. (1984) Realizability and intuitionistic logic. Synthese 60 253–282.
21. Dragalin, A. G. (1969) Transfinite completions of constructive arithmetical calculus (Russian). Doklady 189 458–460. (Translation SM 10 1417-1420.)
22. Ersov, Y. L. (1973) Theorie der Numerierungen. Zeitschrift far Math. Log. 19 (4) 289–388.
23. Feferman, S. (1975) A language and axioms for explicit mathematics. In: Crossley, J. (ed.) Algebra and Logic, Springer-Verlag 87–139.
24. Fourman, M.P., Mulvey, C. J. and Scott, D. S. (eds.) (1979) Applications of Sheaves. Springer-Verlag Lecture Notes in Mathematics 753.
25. Fourman, M.P and Scott, D. S. (1979) Sheaves and logic. In: Fourman, M.P., Mulvey, C. J. and Scott, D. S. (eds.) Applications of Sheaves. Springer-Verlag Lecture Notes in Mathematics 753 302–401.
26. Friedman, H. M. (1977) On the derivability of instantiation properties. Journal of Symbolic Logic 42 506–514.
27. Gavrilenko, Yu. V. (1981) Recursive realizability from the intuitionistic point of view (Russian). Doklady 256 18–22. (Translation SM 239-14.)
28. Godel, K. (1932) Zur intuitionistischen arithmetik und zahlentheorie. Ergebnisse eines mathematis-ches Kolloquiums 4 34–38.
29. Goodman, N. D. (1978) Relativized realizability in intuitionistic arithmetic of all finite types. Journal of Symbolic Logic 43 23–44.
30. Gordeev, L. (1980) Constructive models for set theory with extensionality. In: Troelstra, A. S. and van Dalen, D. (eds.) The L. E. J. Brouwer Centenary Symposium, North-Holland Publishing Company 123–148.
31. Grayson, R.J. (1981a) Derived rules obtained by a model-theoretic approach to realizability. (Handwritten notes from Munster University.)
32. Grayson, R.J. (1981b) Modified realizability toposes. (Handwritten notes from Munster University.)
33. Grayson, R.J. (1981c). Note on extensional realizability. (Handwritten notes from Munster University.)
34. Harrop, R. (1956) On disjunctions and existential statements in intuitionistic systems of logic. Mathematische Annalen 132 347–361.
35. Heyting, A. (ed.) (1959) Constructivity in Mathematics, North-Holland Publishing Company.
36. Higgs, D. (1973) A category approach to boolean-valued set theory. Technical report, University of Waterloo.
37. Higgs, D. (1984) Injectivity in the topos of complete heyting algebra valued sets. Canadian Journal of Mathematics 36 (3) 550–568.
38. Hilbert, D. and Bernays, P. (1934) Grundlagen der Mathematik I, Springer Verlag.
39. Howard, W.A. (1980) To H. B. Curry: The formulae-as-types notion of construction. In: Seldin, J. P. and Hindley, J. R. (eds.) To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalisms, Academic Press.
40. Hyland, J. M. E. (1980) The effective topos. In: Troelstra, A. S. and van Dalen, D. (eds.) The L.E.J. Brouwer Centenary Symposium, North-Holland Publishing Company 165–216.
41. Hyland, J. M. E. (1982) Realizability toposes. (Talk in Amsterdam — notes by Troelstra.)
42. Hyland, J. M. E. (1988) A small complete category. Journal of Pure and Applied Logic 40 135–165.
43. Hyland, J.M.E. (1992) First steps in synthetic domain theory. In: Carboni, A., Pedicchio, M.C. and Rosolini, G. (eds.) Category Theory ’90, Como. Springer-Verlag Lecture Notes in Mathematics 1488 131–156.
44. Hyland, J. M. E. (2002) Variations on realizability. Mathematical Structures in Computer Science 12 295–317 (later in this issue).
45. Hyland, J. M. E., Johnstone, P. T. and Pitts, A. M. (1980) Tripos theory. Math. Proc. Camb. Phil. Soc. 88 205–232.
46. Hyland, J. M. E. and Ong, C.-H.L. (1993) Modified realizability toposes and strong normalisation proofs. In: Groote, J. F. and Bezem, M. (eds.) Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 664 179–194.
47. Hyland, J. M. E., Robinson, E. P. and Rosolini, G. (1990) The discrete objects in the effective topos. Proceedings of the London Mathematical Society 60 1–60.
48. Johnstone, P. T. (1977) Topos Theory, LMS Mathematical Monographs 10, Academic Press.
49. Joyal, A. and Moerdijk, I. (1995) Algebraic Set Theory, London Mathematical Society Lecture Note Series 220, Cambridge University Press.
50. Kleene, S. C. (1945) On the interpretation of intuitionistic number theory. Journal of Symbolic Logic 10 109–124.
51. Kleene, S. C. (1959) Recursive functionals and quantifiers of finite types I. Trans. Amer. Math. Soc. 91 1–52.
52. Kleene, S. C. (1960) Realizability and Shanin’s algorithm for the constructive deciphering of mathematical sentences. Logique et Analyse, Nouvelle Serie 3 154–165.
53. Kleene, S. C. (1962) Disjunction and existence under implication in elementary intuitionistic for-malisms. Journal of Symbolic Logic 27 11–18. Addenda in: Journal of Symbolic Logic (1963) 28 154–156.
54. Kleene, S. C. (1965) Logical calculus and realizability. Acta Philosophica Fennica 18 71–80.
55. Kleene, S. C. (1969) Formalised recursive functionals and formalised realizability. Memoirs of the American Mathematical Society 89.
56. Kleene, S.C. (1973) Realizability: a retrospective survey. In: Mathias, A.R.D. and Rogers, H. (eds.) (1973) Cambridge Summer School in Mathematical Logic. Springer-Verlag Lecture Notes in Mathematics 337 95–112.
57. Kleene, S. C. and Vesley, R. E. (1965) The Foundations of Intuitionistic Mathematics, especially in relation to recursive functions, North-Holland Publishing Company.
58. Kreisel, G. (1959) Interpretation of analysis by means of functionals of finite type. In: Heyting, A. (ed.) Constructivity in Mathematics, North-Holland Publishing Company 101–128.
59. Lambek, J. and Scott, P. J. (1986) Introduction to Higher Order Categorical Logic, Cambridge University Press.
60. Lipton, J. (1990) Constructive Kripke semantics and realizability. In: Moschovakis, Y.N. (ed.) Logic from Computer Science, Springer-Verlag. (Also as Technical Report 90–71, from Cornell University.)
61. Lipton, J. and O’Donnell, M. J. (1996) Some intuitions behind realizability semantics for constructive logic: Tableaux and Lauchli countermodels. Annals of Pure and Applied Logic 81 187–239.
62. Longley, J. (1995) Realizability Toposes and Language Semantics, Ph. D. thesis, Edinburgh University.
63. Mac Lane, S. (1996) Stephen Cole Kleene - a reminiscence. Annals of Pure and Applied Logic 81 3–7.
64. Mathias, A. R. D. and Rogers, H. (eds.) (1973) Cambridge Summer School in Mathematical Logic. Springer-Verlag Lecture Notes in Mathematics 337.
65. Medvedev, Yu. T. (1962) Finite problems (Russian). Doklady 142 1015–1018. (Translation SM 3 227–230.
66. Menni, M. (1999) A characterization of the left exact categories whose exact completions are toposes. (Manuscript, submitted for publication.)
67. Menni, M. (2000) Exact Completions and Toposes, Ph. D. thesis, University of Edinburgh.
68. Moerdijk, I. (1995) A model for intuitionistic nonstandard arithmetic. Annals of Pure and Applied Logic 73 37–51.
69. Moschovakis, J. R. (1971) Can there be no nonrecursive functions? Journal of Symbolic Logic 36 309–315.
70. Nelson, D. (1947) Recursive functions and intuitionistic number theory. Transactions of the American Mathematical Society 61 307–368, 556.
71. Phoa, W. (1990) Effective domains and intrinsic structure. In: Mitchell, J. (ed.) 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, IEEE Computer Society Press 366–377.
72. Pitts, A. M. (1981) The Theory of Triposes, Ph. D. thesis, Cambridge University.
73. Plisko, V. E. (1983) Absolute realizability of predicate formulas (Russian). Izv. Akad. Nauk. 47 315–334. (Translation Math. Izv. 22 291-308.)
74. Renardel de Lavalette, G. R. (1990) Extended bar induction in applicative theories. Annals of Pure and Applied Logic 50 139–189.
75. Reus, B. and Streicher, T. (1999) General synthetic domain theory-a logical approach. Mathematical Structures in Computer Science 9 177–223.
76. Robinson, E. P. (1989) How complete is PER? In: Meyer, A. R. (ed.) Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science, Asilomar, IEEE Computer Society Press 106–111
77. Robinson, E. P. and Rosolini, G. (1990) Colimit completions and the effective topos. Journal of Symbolic Logic 55 678–699.
78. Rose, G. F. (1953) Propositional calculus and realizibility. Transactions of the American Mathematical Society 75 1–19.
79. Rosicky, J. (1997) Cartesian closed exact completions. Available from the Hypatia Electronic Library: http://hypatia.dcs.qmw.ac.uk.
80. Rosolini, G. (1986) Continuity and Effectiveness in Topoi, Ph. D. thesis, University of Oxford.
81. Rosolini, G. (1990) About modest sets. International Journal of Foundations of Computer Science 1 341–353.
82. Rosolini, G. (2000) Equilogical spaces and filter spaces. Rend. Circ. Mat. Palermo 64 (suppl.) 157–175.
83. Scott, D. S. (1979) Identity and existence in intuitionistic logic. In: Fourman, M.P., Mulvey, C. J. and Scott, D. S. (eds.) Applications of Sheaves. Springer-Verlag Lecture Notes in Mathematics 753 660–696.
84. Scott, D. S. (1986) Church’s thesis and a unification of types. Lecture at the Conference on Church’s Thesis: Fifty Years Later, Utrecht.
85. Scott, D. S. (1996) A new category? Domains, spaces and equivalence relations. (Manuscript.)
86. Seldin, J. P. and Hindley, J. R. (eds.) (1980) To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalisms, Academic Press.
87. Staples, J. (1973) Combinator realizability of constructive finite type analysis. In: Mathias, A. R. D. and Rogers, H. (eds.) Cambridge Summer School in Mathematical Logic. Springer-Verlag Lecture Notes in Mathematics 337 253–273.
88. Streicher, T. (1994) Investigations into intensional type theory. Habilitationsschrift, Universitat Munchen.
89. Streicher, T. (1997) A topos for computable analysis. (Note of a talk presented at PSSL, May 1997 in Utrecht, Holland.) Available electronically at www.mathematik.uni-darmstadt.de/streicher.
90. Swaen, M. D. G. (1989) Weak and Strong Sum-Elimination in Intuitionistic Type Theory, Ph. D. thesis, Universiteit van Amsterdam.
91. Taylor, P. (1991) The fixed point property in synthetic domain theory. In: 6th Symp. on Logic in Computer Science, IEEE Computer Society Press 152–160.
92. Troelstra, A. S. (1971) Notions of realizability for intuitionistic arithmetic and intuitionistic arith-metic in all finite types. In: Fenstad, J.E. (ed.) The Second Scandinavian Logic Symposium, North-Holland 369–405.
93. Troelstra, A. S. (ed.) (1973) Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Springer. With contributions by A. S. Troelstra, C. A. Smorynski, J. I. Zucker and W. A. Howard.
94. Troelstra, A. S. (1998) Realizability. In: Buss, S. R. (ed.) Handbook of Proof Theory, North-Holland 407–473.
95. Troelstra, A. S. and van Dalen, D. (eds.) (1980) The L.E. J. Brouwer Centenary Symposium, North-Holland Publishing Company.
96. Troelstra, A. S. and van Dalen, D. (1988) Constructivism in Mathematics, (2 volumes), North-Holland.
97. van Oosten, J. (1991a) Exercises in Realizability, Ph. D. thesis, Universiteit van Amsterdam.
98. van Oosten, J. (1991b) A semantical proof of de Jongh’s theorem. Arch. Math. Logic 31 (2) 105–114.
99. van Oosten, J. (1994) Axiomatizing higher-order Kleene realizability. Annals of Pure and Applied Logic 70 87–111.
100. van Oosten, J. (1997a) Extensional realizability. Annals of Pure and Applied Logic 84 317–349.
101. van Oosten, J. (1997b) The modified realizability topos. Journal of Pure and Applied Algebra 116 273–289.
102. van Oosten, J. and Simpson, A. K. (2000) Axioms and (counter)examples in synthetic domain theory. Annals of Pure and Applied Logic 104 233–278.
103. Wraith, G. (1974) Artin glueing. Journal of Pure and Applied Algebra 4 345–348.