Formal Topologies on the set of first-order formulae

Journal of Symbolic Logic

Volumn 65, Issue 3, 2000, Pages 1183-1192

  Coquand, Thierry ^a   Sadocco, Sara ^b   Sambin, Giovanni ^c   Smith, Jan M ^a  

^a UNIVERSITY OF GOTHENBURG   (Sweden)

^b UNIVERSITY OF SIENA   (Italy)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034258762     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586694     Document Type: Article

References (17)

1. E. BISHOP, Foundations of constructive analysis, McGraw-Hill, New York, 1967.
2. J. CEDERQUIST, A pointfree approach to constructive analysis in type theory, Ph.d. thesis, Chalmers University of Technology and University of Göteborg, Sweden, 1997.
3. T. COQUAND and J. M. SMITH, An application of constructive completeness, Proceedings of the Workshop TYPES '95, Torino, Italy, June 1995 (Berardi and Coppo, editors), Lecture Notes in Computer Science, no. 1158, Springer-Verlag, 1996, pp. 76-84.
4. A. G. DRAGALIN, An explicit Boolean-valued model for non-standard arithmetic, Publications Mathematicae Drebecen, vol. 42 (1993), pp. 369-389.
5. S. FEFERMAN, Review of "A proof of the completeness theorem of Gödel" by H. Rasiowa and R. Sikorski, this JOURNAL, vol. 17 (1952), no. 1, p. 72.
6. M. P. FOURMAN and R. J. GRAYSON, Formal Spaces, Brouwer Centenary Symposium (A. S. Troelstra and D. van Dalen, editors), North-Holland, 1982, pp. 107-122.
7. L. HENKIN, The completeness of first-order functional calculus, this JOURNAL, vol. 14 (1949), pp. 159-166.
8. P. T. JOHNSTONE, Open locales and exponentiation, Mathematical Applications of Category Theory, A.M.S. Contemporary Mathematical series, vol. 30, 1984.
9. H. M. MACNEILLE, Partially ordered sets, Transactions of the American Mathematical Society, vol. 42 (1937), pp. 416-460.
10. I. MOERDIJK and E. PALMGREN, Minimal models of Heyting arithmetic, this JOURNAL, vol. 62 (1997), no. 4, pp. 1448-1460.
11. B. NORDSTRÖM, K. PETERSSON, and J. M. SMITH, Programming in Martin-Löf's type theory. an introduction., Oxford University Press, 1990.
12. H. PERSSON, Constructive completeness of intuitionistic predicate logic: A formalisation in type theory, Licentiate Thesis, Chalmers University of Technology and University of Göteborg, Sweden, November 1996.
13. H. RASIOWA and R. SIKORSKI, A proof of the completeness theorem of Gödel, Fundamenta Mathematicae, vol. 37 (1950), pp. 193-200.
14. S. SADOCCO, Topologie formali sull'insieme delle formule. Tesi di laurea, University of Padova, February 1996.
15. G. SAMBIN, Intuitionistic Formal Spaces - A First Communication, Mathematical logic and its applications (D. Skordev, editor), Plenum, 1987, pp. 187-204.
16. _, Pretopologies and completeness proofs, this JOURNAL, vol. 60 (1995), pp. 861-878.
17. G. SAMBIN and S. VALENTINI, Building up a toolbox for Martin-Löf's type theory: subset theory, Twenty-five years of constructive type theory (Giovanni Sambin and Jan M. Smith, editors), Oxford University Pres,. 1998, pp. 221-244.