Switch to: References

Add citations

You must login to add citations.
  1. Computational adequacy for recursive types in models of intuitionistic set theory.Alex Simpson - 2004 - Annals of Pure and Applied Logic 130 (1-3):207-275.
    This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. Our approach is to view such models as full subcategories of categorical models of intuitionistic set theory. It is shown that the existence of solutions to recursive domain equations depends upon the strength of the set theory. We observe that the internal set theory of an elementary topos is not strong enough to guarantee their existence. In contrast, (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A brief introduction to algebraic set theory.Steve Awodey - 2008 - Bulletin of Symbolic Logic 14 (3):281-298.
    This brief article is intended to introduce the reader to the field of algebraic set theory, in which models of set theory of a new and fascinating kind are determined algebraically. The method is quite robust, applying to various classical, intuitionistic, and constructive set theories. Under this scheme some familiar set theoretic properties are related to algebraic ones, while others result from logical constraints. Conventional elementary set theories are complete with respect to algebraic models, which arise in a variety of (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Intuitionistic fixed point logic.Ulrich Berger & Hideki Tsuiki - 2021 - Annals of Pure and Applied Logic 172 (3):102903.
    We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction free formulas. The interpretation is shown to be sound with respect to a domain-theoretic denotational semantics and a corresponding lazy operational semantics of a functional language for extracted programs. We also show how (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Relating first-order set theories and elementary toposes.Steve Awodey, Carsten Butz & Alex Simpson - 2007 - Bulletin of Symbolic Logic 13 (3):340-358.
    We show how to interpret the language of first-order set theory in an elementary topos endowed with, as extra structure, a directed structural system of inclusions (dssi). As our main result, we obtain a complete axiomatization of the intuitionistic set theory validated by all such interpretations. Since every elementary topos is equivalent to one carrying a dssi, we thus obtain a first-order set theory whose associated categories of sets are exactly the elementary toposes. In addition, we show that the full (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Relational dual tableau decision procedures and their applications to modal and intuitionistic logics.Joanna Golińska-Pilarek & Taneli Huuskonen - 2014 - Annals of Pure and Applied Logic 165 (2):428-502.
    This paper introduces Basic Intuitionistic Set Theory BIST, and investigates it as a first-order set theory extending the internal logic of elementary toposes. Given an elementary topos, together with the extra structure of a directed structural system of inclusions on the topos, a forcing-style interpretation of the language of first-order set theory in the topos is given, which conservatively extends the internal logic of the topos. This forcing interpretation applies to an arbitrary elementary topos, since any such is equivalent to (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Relating First-Order Set Theories and Elementary Toposes.Steve Awodey & Thomas Streicher - 2007 - Bulletin of Symbolic Logic 13 (3):340-358.
    We show how to interpret the language of first-order set theory in an elementary topos endowed with, as extra structure, a directed structural system of inclusions . As our main result, we obtain a complete axiomatization of the intuitionistic set theory validated by all such interpretations. Since every elementary topos is equivalent to one carrying a dssi, we thus obtain a first-order set theory whose associated categories of sets are exactly the elementary toposes. In addition, we show that the full (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Relating first-order set theories, toposes and categories of classes.Steve Awodey, Carsten Butz, Alex Simpson & Thomas Streicher - 2014 - Annals of Pure and Applied Logic 165 (2):428-502.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Synthetic domain theory and models of linear Abadi & Plotkin logic.Rasmus Ejlers Møgelberg, Lars Birkedal & Giuseppe Rosolini - 2008 - Annals of Pure and Applied Logic 155 (2):115-133.
    Plotkin suggested using a polymorphic dual intuitionistic/linear type theory as a metalanguage for parametric polymorphism and recursion. In recent work the first two authors and R.L. Petersen have defined a notion of parametric LAPL-structure, which are models of image, in which one can reason using parametricity and, for example, solve a large class of domain equations, as suggested by Plotkin.In this paper, we show how an interpretation of a strict version of Bierman, Pitts and Russo’s language image into synthetic domain (...)
    Download  
     
    Export citation  
     
    Bookmark