On the formal points of the formal topology of the binary tree

Archive for Mathematical Logic

Volumn 41, Issue 7, 2002, Pages 603-618

  Valentini, Silvio ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035981346     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530100133     Document Type: Article

References (12)

1. [CSSV] Coquand, T., Sambin, G., Smith, J., Valentini, S.: Inductively generated formal topologies, to appear
2. [Eng77] Engelking, R.: General Topology, Polish Scientific Publisher, Warszawa, 1977
3. [Mai99] Maietti, M.E.: About effective quotients in constructive type theory in "Types for Proofs and Programs", Altenkirch, T., Naraschewski, W., Reus, B. eds., Lecture Notes in Computer Science 1657, Springer Verlag, 164-178 (1999)
4. [MV99] Maietti, M.E., Valentini, S.: Can you add power-set to Martin-Löf intuitionistic set theory? Mathematical Logic Quarterly 45, 521-532 (1999)
5. [ML84] Martin-Löf, P.: Intuitionistic Type Theory, notes by G. Sambin of a series of lectures given in Padua, Bibliopolis, Naples, 1984
6. [Neg96] Negri, S.: Dalla topologia formale all'analisi, Tesi di dottorato, Padova, 1996
7. [NPS90] Nordström, B., Peterson, K., Smith, J.: Programming in Martin-Löf's Type Theory, An introduction, Clarendon Press, Oxford, 1990
8. [SV98] Sambin, G., Valentini, S.: Building up a tool-box for Martin-Löf intuitionistic type theory, in "Twenty-five years of Constructive Type Theory", Sambin, G., Smith, J. (eds.), Oxford logic guides 36, 221-244 (1998)
9. [Val96] Valentini, S.: Decidability in Intuitionistic Theory of Types is functionally decidable, Mathematical Logic Quarterly 42, 300-304 (1996)
10. [Val99] Valentini, S.: The problem of completeness of formal topologies with a binary positivity predicate and their inductive generation, to appear
11. [Val00] Valentini, S.: Extensionality versus Constructivity, Mathematical Logic Quarterly, to appear
12. [Vic89] Vickers, S.: Topology via Logic, Cambridge Tracts in Theoretical Computer Science, vol. 5, Cambridge University Press, 1989