Switch to: References

Add citations

You must login to add citations.
  1. On Non-wellfounded Sets as Fixed Points of Substitutions.Matti Pauna - 2001 - Notre Dame Journal of Formal Logic 42 (1):23-40.
    We study the non-wellfounded sets as fixed points of substitution. For example, we show that ZFA implies that every function has a fixed point. As a corollary we determine for which functions f there is a function g such that . We also present a classification of non-wellfounded sets according to their branching structure.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • Labelling classes by sets.M. Victoria Marshall & M. Gloria Schwarze - 2005 - Archive for Mathematical Logic 44 (2):219-226.
    Let Q be an equivalence relation whose equivalence classes, denoted Q[x], may be proper classes. A function L defined on Field(Q) is a labelling for Q if and only if for all x,L(x) is a set and L is a labelling by subsets for Q if and only if BG denotes Bernays-Gödel class-set theory with neither the axiom of foundation, AF, nor the class axiom of choice, E. The following are relatively consistent with BG. (1) E is true but there (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
    		•