Tripos theory in retrospect

Mathematical Structures in Computer Science

Volumn 12, Issue 3, 2002, Pages 265-279

  Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84962276417     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S096012950200364X     Document Type: Article

References (23)

1. 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. FloC’99, Trento, Italy. Electronic Notes in Computer Science 23, Elsevier.
2. Birkedal, L., van Oosten, J., Rosolini, G. and Scott, D. S. (eds.) (1999) Tutorial Workshop on Realizability Semantics. FloC’99, Trento, Italy. Electronic Notes in Computer Science 23, Elsevier.
3. Fourman, M.P. and Scott, D. S. (1979) Sheaves and logic. In: Fourman, P. Mulvey, C. J. and Scott, D. S. (eds.) Applications of Sheaves. Springer-Verlag Lecture Notes in Mathematics 753 302–401.
4. Hofmann, M. (1999) Semantical analysis of higher-order abstract syntax. In: 14th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press 204–213.
5. 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 165–216.
6. Hyland, J. M. E. (1988) A small complete category. Journal of Pure and Applied Logic 40 135–165.
7. Hyland, J. M. E., Johnstone, P. T. and Pitts, A. M. (1980) Tripos theory. Math. Proc. Camb. Phil. Soc. 88 205–232.
8. Johnstone, P. T. (1977) Topos Theory, LMS Mathematical Monographs 10, Academic Press.
9. Johnstone, P. T. and Pare, R. (eds.) (1978) Indexed Categories and Their Applications. Springer-Verlag Lecture Notes in Mathematics 661.
10. Kleene, S. C. (1945) On the interpretation of intuitionistic number theory. Journal of Symbolic Logic 10 109–124.
11. Lawvere, F. W. (1969) Adjointness in foundations. Dialectica 23 281–296.
12. Lawvere, F. W. (1970) Equality in hyperdoctrines and the comprehension schema as an adjoint functor. In: Heller, A. (ed.) Applications of Categorical Algebra, American Mathematical Society 1–14.
13. Longley, J. (1995) Realizability Toposes and Language Semantics, Ph. D. thesis, Edinburgh University.
14. Makkai, M. (1993) The fibrational formulation of intuitionistic predicate logic. I: Completeness according to Godel, Kripke and Lauchli. Notre Dame Journal of Formal Logic 34 334–377.
15. Makkai, M. and Reyes, G. E. (1977) First Order Categorical Logic. Springer-Verlag Lecture Notes in Mathematics 611.
16. Phoa, W. (1990) Domain Theory in Realizability Toposes, Ph. D. thesis, Cambridge University.
17. Pitts, A. M. (1981) The Theory of Triposes, Ph. D. thesis, Cambridge University.
18. Pitts, A.M. (1989) Conceptual completeness for first order intuitionistic logic: an application of categorical logic. Ann. Pure Applied Logic 41 33–81.
19. Pitts, A. M. (1992) On an interpretation of second order quantification in first order intuitionistic propositional logic. Jour. Symbolic Logic 57 33–52.
20. Pitts, A.M. (2000) Categorical logic. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science 5, Oxford University Press.
21. Reus, B. and Streicher, T. (1999) General synthetic domain theory — a logical approach. Mathematical Structures in Computer Science 9 177–223.
22. Rosolini, G. (1990) About modest sets. International Journal of Foundations of Computer Science 1 341–353.
23. van Oosten, J. (1991) Exercises in Realizability, Ph. D. thesis, Universiteit van Amsterdam.