Two applications of Boolean models

Archive for Mathematical Logic

Volumn 37, Issue 3, 1998, Pages 143-147

  Coquand, Thierry ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032395859     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050088     Document Type: Article

References (7)

1. G. Dowek (1994) Automated Theorem Proving in Type Theory. Lecture Notes for Summer School in Chambery, July 1994.
2. A.G. Dragalin. (1995) Explicit algebraic models for constructive and classical non-standard elements. Studia Logica 55 (1995), p. 33-61.
3. P. Martin-Löf. Intuitionistic Type Theory. Studies in Proof Theory, Bibliopolis, 1984.
4. A. Mostowski. (1948) Proofs of non-deducibility in intuitionistic functional calculus. Journal of Symbolic Logic 13 (1948), p. 204-207
5. H. Rasiowa and R. Sikorski. The Mathematics of Metamathematics. Warszawa, 1963.
6. J.R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.
7. H. Schwichtenberg. Proof Theory: Some applications of cut-elimination. in J. Barwise, editor. Handbook of Mathematical Logic, North-Holland, p. 867-895, 1977.