This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories
Siblings:
7 found
Search inside:
(import / add options)   Sort by:
  1. Varol Akman (1997). Review of J. Barwise and L. Moss, Vicious Circles: On the Mathematics of Non-Wellfounded Phnenomena. [REVIEW] Journal of Logic, Language and Information 6 (4):460-464.
    This is a review of Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena, by Jon <span class='Hi'>Barwise</span> and Lawrence Moss, published by CSLI (Center for the Study of Language and Information) Publications in 1996.
    Remove from this list | Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  2. Luca Incurvati (2012). The Graph Conception of Set. Journal of Philosophical Logic (1):1-28.
    The non-well-founded set theories described by Aczel (1988) have received attention from category theorists and computer scientists, but have been largely ignored by philosophers. At the root of this neglect might lie the impression that these theories do not embody a conception of set, but are rather of mere technical interest. This paper attempts to dispel this impression. I present a conception of set which may be taken as lying behind a non-well-founded set theory. I argue that the axiom AFA (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. I. Jane & G. Uzquiano (2004). Well-and Non-Well-Founded Fregean Extensions. Journal of Philosophical Logic 33 (5):437--465.
    George Boolos has described an interpretation of a fragment of ZFC in a consistent second-order theory whose only axiom is a modification of Frege's inconsistent Axiom V. We build on Boolos's interpretation and study the models of a variety of such theories obtained by amending Axiom V in the spirit of a limitation of size principle. After providing a complete structural description of all well-founded models, we turn to the non-well-founded ones. We show how to build models in which foundation (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Christopher Menzel (forthcoming). Wide Sets, ZFCU, and the Iterative Conception. Journal of Philosophy.
    In a 1996 paper, Daniel Nolan showed that David Lewis's principle of Recombination entails that, for any cardinal number k, there are at least k urelements (non-sets). Call this proposition A. More recently, Ted Sider has shown that Nolan's basic argument can be reconstructed in the context of Williamson's theory of necessary existence. It is a simple matter to show in ZFCU (Zermelo-Fraenkel set theory with Choice and urelements) that A is incompatible with the proposition SoA that there is a (...)
    Remove from this list |
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Richard Pettigrew (2010). The Foundations of Arithmetic in Finite Bounded Zermelo Set Theory. Cahiers du Centre de Logique 17:99-118.
    In this paper, I pursue such a logical foundation for arithmetic in a variant of Zermelo set theory that has axioms of subset separation only for quantifier-free formulae, and according to which all sets are Dedekind finite. In section 2, I describe this variant theory, which I call ZFin0. And in section 3, I sketch foundations for arithmetic in ZFin0 and prove that certain foundational propositions that are theorems of the standard Zermelian foundation for arithmetic are independent of ZFin0.<br><br>An equivalent (...)
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  6. Richard Pettigrew (2009). On Interpretations of Bounded Arithmetic and Bounded Set Theory. Notre Dame Journal of Formal Logic 50 (2):141-152.
    In 'On interpretations of arithmetic and set theory', Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic.

    THEOREM 1 The first-order theories of Peano arithmetic and Zermelo-Fraenkel set theory with the axiom of infinity negated are bi-interpretable.

    In this note, I describe a theory of sets that is bi-interpretable with the theory of bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot straightforwardly adapt Kaye and Wong's (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. Sylvia Wenmackers & Leon Horsten (2013). Fair Infinite Lotteries. Synthese 190 (1):37-61.
    This article discusses how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. Techniques and ideas from non-standard analysis are brought to bear on the problem.
    Remove from this list | Direct download (10 more)  
     
    My bibliography  
     
    Export citation