Switch to: References

Add citations

You must login to add citations.
  1. (15 other versions)2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000.Carol Wood - 2001 - Bulletin of Symbolic Logic 7 (1):82-163.
    Download  
     
    Export citation  
     
    Bookmark  
  • Wellfounded trees in categories.Ieke Moerdijk & Erik Palmgren - 2000 - Annals of Pure and Applied Logic 104 (1-3):189-218.
    In this paper we present and study a categorical formulation of the W-types of Martin-Löf. These are essentially free term algebras where the operations may have finite or infinite arity. It is shown that W-types are preserved under the construction of sheaves and Artin gluing. In the proofs we avoid using impredicative or nonconstructive principles.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • On the Strength of some Semi-Constructive Theories.Solomon Feferman - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter. pp. 201-226.
    Most axiomatizations of set theory that have been treated metamathematically have been based either entirely on classical logic or entirely on intuitionistic logic. But a natural conception of the settheoretic universe is as an indefinite (or “potential”) totality, to which intuitionistic logic is more appropriately applied, while each set is taken to be a definite (or “completed”) totality, for which classical logic is appropriate; so on that view, set theory should be axiomatized on some correspondingly mixed basis. Similarly, in the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Boolean model of ultrafilters.Thierry Coquand - 1999 - Annals of Pure and Applied Logic 99 (1-3):231-239.
    We introduce the notion of Boolean measure algebra. It can be described shortly using some standard notations and terminology. If B is any Boolean algebra, let BN denote the algebra of sequences , xn B. Let us write pk BN the sequence such that pk = 1 if i K and Pk = 0 if k < i. If x B, denote by x* BN the constant sequence x* = . We define a Boolean measure algebra to be a Boolean (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Type theories, toposes and constructive set theory: predicative aspects of AST.Ieke Moerdijk & Erik Palmgren - 2002 - Annals of Pure and Applied Logic 114 (1-3):155-201.
    We introduce a predicative version of topos based on the notion of small maps in algebraic set theory, developed by Joyal and one of the authors. Examples of stratified pseudotoposes can be constructed in Martin-Löf type theory, which is a predicative theory. A stratified pseudotopos admits construction of the internal category of sheaves, which is again a stratified pseudotopos. We also show how to build models of Aczel-Myhill constructive set theory using this categorical structure.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Heyting-valued interpretations for constructive set theory.Nicola Gambino - 2006 - Annals of Pure and Applied Logic 137 (1-3):164-188.
    We define and investigate Heyting-valued interpretations for Constructive Zermelo–Frankel set theory . These interpretations provide models for CZF that are analogous to Boolean-valued models for ZF and to Heyting-valued models for IZF. Heyting-valued interpretations are defined here using set-generated frames and formal topologies. As applications of Heyting-valued interpretations, we present a relative consistency result and an independence proof.
    Download  
     
    Export citation  
     
    Bookmark   17 citations