Switch to: Citations

Add references

You must login to add references.
  1. Refinement Calculus: A Systematic Introduction.Ralph-Johan Back & Joakim Wright - 1998 - Springer.
    Much current research in computer science is concerned with two questions: is a program correct? And how can we improve a correct program preserving correctness? This latter question is known as the refinement of programs and the purpose of this book is to consider these questions in a formal setting. In fact, correctness turns out to be a special case of refinement and so the focus is on refinement. Although a reasonable background knowledge is assumed from mathematics and CS, the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • The problem of the formalization of constructive topology.Silvio Valentini - 2005 - Archive for Mathematical Logic 44 (1):115-129.
    Abstract.Formal topologies are today an established topic in the development of constructive mathematics. One of the main tools in formal topology is inductive generation since it allows to introduce inductive methods in topology. The problem of inductively generating formal topologies with a cover relation and a unary positivity predicate has been solved in [CSSV]. However, to deal both with open and closed subsets, a binary positivity predicate has to be considered. In this paper we will show how to adapt to (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A Philosophically Plausible Formal Interpretation of Intuitionistic Logic.Andrzej Grzegorczyk - 1971 - Journal of Symbolic Logic 36 (2):329-329.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Topology via Logic.P. T. Johnstone & Steven Vickers - 1991 - Journal of Symbolic Logic 56 (3):1101.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • A semantics of evidence for classical arithmetic.Thierry Coquand - 1995 - Journal of Symbolic Logic 60 (1):325-337.
    Download  
     
    Export citation  
     
    Bookmark   22 citations