Switch to: Citations

Add references

You must login to add references.
  1. Inductively generated formal topologies.Thierry Coquand, Giovanni Sambin, Jan Smith & Silvio Valentini - 2003 - Annals of Pure and Applied Logic 124 (1-3):71-106.
    Formal topology aims at developing general topology in intuitionistic and predicative mathematics. Many classical results of general topology have been already brought into the realm of constructive mathematics by using formal topology and also new light on basic topological notions was gained with this approach which allows distinction which are not expressible in classical topology. Here we give a systematic exposition of one of the main tools in formal topology: inductive generation. In fact, many formal topologies can be presented in (...)
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • Constructive characterizations of bar subsets.Silvio Valentini - 2007 - Annals of Pure and Applied Logic 145 (3):368-378.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Every inductively generated formal cover is spatial, classically.S. Valentini - 2006 - Journal of Symbolic Logic 71 (2):491-500.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Every countably presented formal topology is spatial, classically.Silvio Valentini - 2006 - Journal of Symbolic Logic 71 (2):491-500.
    By using some classical reasoning we show that any countably presented formal topology, namely, a formal topology with a countable axiom set, is spatial.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Translating the hypergame paradox: Remarks on the set of founded elements of a relation. [REVIEW]Claudio Bernardi & Giovanna D'Agostino - 1996 - Journal of Philosophical Logic 25 (5):545 - 557.
    In Zwicker (1987) the hypergame paradox is introduced and studied. In this paper we continue this investigation, comparing the hypergame argument with the diagonal one, in order to find a proof schema. In particular, in Theorems 9 and 10 we discuss the complexity of the set of founded elements in a recursively enumerable relation on the set N of natural numbers, in the framework of reduction between relations. We also find an application in the theory of diagonalizable algebras and construct (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations