Switch to: Citations

Add references

You must login to add references.
  1. Large sets in intuitionistic set theory.Harvey Friedman & Andrej Ščedrov - 1984 - Annals of Pure and Applied Logic 27 (1):1-24.
    We consider properties of sets in an intuitionistic setting corresponding to large cardinals in classical set theory. Adding such ‘large set axioms’ to intuitionistic ZF set theory does not violate well-know metamathematical properties of intuitionistic systems. Moreover, we consider statements in constructive analysis equivalent to the consistency of such ‘large set axioms’.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Transfinite Cardinals in Paraconsistent Set Theory.Zach Weber - 2012 - Review of Symbolic Logic 5 (2):269-293.
    This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Non-classical Models of ZF.S. Jockwich Martinez & G. Venturi - 2020 - Studia Logica 109 (3):509-537.
    This paper contributes to the generalization of lattice-valued models of set theory to non-classical contexts. First, we show that there are infinitely many complete bounded distributive lattices, which are neither Boolean nor Heyting algebra, but are able to validate the negation-free fragment of \. Then, we build lattice-valued models of full \, whose internal logic is weaker than intuitionistic logic. We conclude by using these models to give an independence proof of the Foundation axiom from \.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Models for a paraconsistent set theory.Thierry Libert - 2005 - Journal of Applied Logic 3 (1):15-41.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Generalized Algebra-Valued Models of Set Theory.Benedikt Löwe & Sourav Tarafder - 2015 - Review of Symbolic Logic 8 (1):192-205.
    We generalize the construction of lattice-valued models of set theory due to Takeuti, Titani, Kozawa and Ozawa to a wider class of algebras and show that this yields a model of a paraconsistent logic that validates all axioms of the negation-free fragment of Zermelo-Fraenkel set theory.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • A Strong Model of Paraconsistent Logic.Olivier Esser - 2003 - Notre Dame Journal of Formal Logic 44 (3):149-156.
    The purpose of this paper is mainly to give a model of paraconsistent logic satisfying the "Frege comprehension scheme" in which we can develop standard set theory (and even much more as we shall see). This is the continuation of the work of Hinnion and Libert.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Independence Proofs in Non-Classical Set Theories.Sourav Tarafder & Giorgio Venturi - 2023 - Review of Symbolic Logic 16 (4):979-1010.
    In this paper we extend to non-classical set theories the standard strategy of proving independence using Boolean-valued models. This extension is provided by means of a new technique that, combining algebras (by taking their product), is able to provide product-algebra-valued models of set theories. In this paper we also provide applications of this new technique by showing that: (1) we can import the classical independence results to non-classical set theory (as an example we prove the independence of $\mathsf {CH}$ ); (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations