This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related

Contents
33 found
Order:
  1. Retrieving the Mathematical Mission of the Continuum Concept from the Transfinitely Reductionist Debris of Cantor’s Paradise. Extended Abstract.Edward G. Belaga - forthcoming - International Journal of Pure and Applied Mathematics.
    What is so special and mysterious about the Continuum, this ancient, always topical, and alongside the concept of integers, most intuitively transparent and omnipresent conceptual and formal medium for mathematical constructions and the battle field of mathematical inquiries ? And why it resists the century long siege by best mathematical minds of all times committed to penetrate once and for all its set-theoretical enigma ? -/- The double-edged purpose of the present study is to save from the transfinite deadlock of (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  2. A Reassessment of Cantorian Abstraction based on the ε-operator.Nicola Bonatti - forthcoming - Synthese.
    Cantor's abstractionist account of cardinal numbers has been criticized by Frege as a psychological theory of numbers which leads to contradiction. The aim of the paper is to meet these objections by proposing a reassessment of Cantor's proposal based upon the set theoretic framework of Bourbaki - called BK - which is a First-order set theory extended with Hilbert's ε-operator. Moreover, it is argued that the BK system and the ε-operator provide a faithful reconstruction of Cantor's insights on cardinal numbers. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. Wand/Set Theories: A realization of Conway's mathematicians' liberation movement, with an application to Church's set theory with a universal set.Tim Button - forthcoming - Journal of Symbolic Logic:1-46.
    Here is a template for introducing mathematical objects: “Objects are found in stages. For every stage S: (1) for any things found before S, you find at S the bland set whose members are exactly those things; (2) for anything, x, which was found before S, you find at S the result of tapping x with any magic wand (provided that the result is not itself a bland set); you find nothing else at S.” -/- This Template has rich applications, (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4. The first-order logic of CZF is intuitionistic first-order logic.Robert Passmann - forthcoming - Journal of Symbolic Logic:1-23.
    We prove that the first-order logic of CZF is intuitionistic first-order logic. To do so, we introduce a new model of transfinite computation (Set Register Machines) and combine the resulting notion of realisability with Beth semantics. On the way, we also show that the propositional admissible rules of CZF are exactly those of intuitionistic propositional logic.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. Level Theory, Part 3: A Boolean Algebra of Sets Arranged in Well-Ordered Levels.Tim Button - 2022 - Bulletin of Symbolic Logic 28 (1):1-26.
    On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and a natural (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6. Gödel mathematics versus Hilbert mathematics. I. The Gödel incompleteness (1931) statement: axiom or theorem?Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (9):1-56.
    The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set theory. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7. Level theory, part 2: Axiomatizing the bare idea of a potential hierarchy.Tim Button - 2021 - Bulletin of Symbolic Logic 27 (4):461-484.
    Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, with (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8. Conceptions of Set and the Foundations of Mathematics.Luca Incurvati - 2020 - Cambridge University Press.
    Sets are central to mathematics and its foundations, but what are they? In this book Luca Incurvati provides a detailed examination of all the major conceptions of set and discusses their virtues and shortcomings, as well as introducing the fundamentals of the alternative set theories with which these conceptions are associated. He shows that the conceptual landscape includes not only the naïve and iterative conceptions but also the limitation of size conception, the definite conception, the stratified conception and the graph (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  9. The Graph Conception of Set.Luca Incurvati - 2014 - Journal of Philosophical Logic 43 (1):181-208.
    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)  
     
    Export citation  
     
    Bookmark   6 citations  
  10. Wide Sets, ZFCU, and the Iterative Conception.Christopher Menzel - 2014 - Journal of Philosophy 111 (2):57-83.
    The iterative conception of set is typically considered to provide the intuitive underpinnings for ZFCU (ZFC+Urelements). It is an easy theorem of ZFCU that all sets have a definite cardinality. But the iterative conception seems to be entirely consistent with the existence of “wide” sets, sets (of, in particular, urelements) that are larger than any cardinal. This paper diagnoses the source of the apparent disconnect here and proposes modifications of the Replacement and Powerset axioms so as to allow for the (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  11. Beneš’s Partial Model of $mathsf {NF}$: An Old Result Revisited.Edoardo Rivello - 2014 - Notre Dame Journal of Formal Logic 55 (3):397-411.
    A paper by Beneš, published in 1954, was an attempt to prove the consistency of $\mathsf{NF}$ via a partial model of Hailperin’s finite axiomatization of $\mathsf{NF}$. Here, I offer an analysis of Beneš’s proof in a De Giorgi-style setting for set theory. This approach leads to an abstract version of Beneš’s theorem that emphasizes the monotone and invariant content of the axioms proved to be consistent, in a sense of monotony and invariance that this paper intends to state rigorously and (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12. Fair infinite lotteries.Sylvia Wenmackers & Leon Horsten - 2013 - 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 (9 more)  
     
    Export citation  
     
    Bookmark   41 citations  
  13. A Discussion on Finite Quasi-cardinals in Quasi-set Theory.Jonas Rafael Becker Arenhart - 2011 - Foundations of Physics 41 (8):1338-1354.
    Quasi-set theory Q is an alternative set-theory designed to deal mathematically with collections of indistinguishable objects. The intended interpretation for those objects is the indistinguishable particles of non-relativistic quantum mechanics, under one specific interpretation of that theory. The notion of cardinal of a collection in Q is treated by the concept of quasi-cardinal, which in the usual formulations of the theory is introduced as a primitive symbol, since the usual means of cardinal definition fail for collections of indistinguishable objects. In (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14. A Natural Model of the Multiverse Axioms.Victoria Gitman & Joel David Hamkins - 2010 - Notre Dame Journal of Formal Logic 51 (4):475-484.
    If ZFC is consistent, then the collection of countable computably saturated models of ZFC satisfies all of the Multiverse Axioms of Hamkins.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  15. The foundations of arithmetic in finite bounded Zermelo set theory.Richard Pettigrew - 2010 - 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   Direct download  
     
    Export citation  
     
    Bookmark  
  16. On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  17. Functional interpretations of constructive set theory in all finite types.Justus Diller - 2008 - Dialectica 62 (2):149–177.
    Gödel's dialectica interpretation of Heyting arithmetic HA may be seen as expressing a lack of confidence in our understanding of unbounded quantification. Instead of formally proving an implication with an existential consequent or with a universal antecedent, the dialectica interpretation asks, under suitable conditions, for explicit 'interpreting' instances that make the implication valid. For proofs in constructive set theory CZF-, it may not always be possible to find just one such instance, but it must suffice to explicitly name a set (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18. Binary Refinement Implies Discrete Exponentiation.Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren & Peter Schuster - 2006 - Studia Logica 84 (3):361-368.
    Working in the weakening of constructive Zermelo-Fraenkel set theory in which the subset collection scheme is omitted, we show that the binary refinement principle implies all the instances of the exponentiation axiom in which the basis is a discrete set. In particular binary refinement implies that the class of detachable subsets of a set form a set. Binary refinement was originally extracted from the fullness axiom, an equivalent of subset collection, as a principle that was sufficient to prove that the (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  19. On constructing completions.Laura Crosilla, Hajime Ishihara & Peter Schuster - 2005 - Journal of Symbolic Logic 70 (3):969-978.
    The Dedekind cuts in an ordered set form a set in the sense of constructive Zermelo—Fraenkel set theory. We deduce this statement from the principle of refinement, which we distill before from the axiom of fullness. Together with exponentiation, refinement is equivalent to fullness. None of the defining properties of an ordering is needed, and only refinement for two—element coverings is used. In particular, the Dedekind reals form a set; whence we have also refined an earlier result by Aczel and (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  20. Standard sets in nonstandard set theory.Petr Andreev & Karel Hrbacek - 2004 - Journal of Symbolic Logic 69 (1):165-182.
    We prove that Standardization fails in every nontrivial universe definable in the nonstandard set theory BST, and that a natural characterization of the standard universe is both consistent with and independent of BST. As a consequence we obtain a formulation of nonstandard class theory in the ∈-language.
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  21. Well- and non-well-founded Fregean extensions.Ignacio Jané & Gabriel Uzquiano - 2004 - 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 (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  22. Aggregate theory versus set theory.Hartley Slater - 2003 - Erkenntnis 59 (2):189 - 202.
    Maddy's (1990) arguments against Aggregate Theory were undermined by the shift in her position in 1997. The present paper considers Aggregate Theory in the light of this, and the recent search for `New Axioms for Mathematics'. If Set Theory is the part-whole theory of singletons, then identifying singletons with their single members collapses Set Theory into Aggregate Theory. But if singletons are not identical to their single members, then they are not extensional objects and so are not a basis for (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  23. Inaccessible set axioms may have little consistency strength.L. Crosilla & M. Rathjen - 2002 - Annals of Pure and Applied Logic 115 (1-3):33-70.
    The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form Vκ where κ is a strongly inaccessible cardinal and Vκ denotes the κth level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of this paper is to show that the consistency strength of inaccessible set axioms heavily depend on the context in (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  24. An axiomatics for nonstandard set theory, based on von Neumann–Bernays–Gödel Theory.P. V. Andreev & E. I. Gordon - 2001 - Journal of Symbolic Logic 66 (3):1321-1341.
    We present an axiomatic framework for nonstandard analysis-the Nonstandard Class Theory which extends von Neumann-Godel-Bernays Set Theory by adding a unary predicate symbol St to the language of NBG means that the class X is standard) and axioms-related to it- analogs of Nelson's idealization, standardization and transfer principles. Those principles are formulated as axioms, rather than axiom schemes, so that NCT is finitely axiomatizable. NCT can be considered as a theory of definable classes of Bounded Set Theory by V. Kanovei (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  25. New V, ZF and Abstraction.Stewart Shapiro & Alan Weir - 1999 - Philosophia Mathematica 7 (3):293-321.
    We examine George Boolos's proposed abstraction principle for extensions based on the limitation-of-size conception, New V, from several perspectives. Crispin Wright once suggested that New V could serve as part of a neo-logicist development of real analysis. We show that it fails both of the conservativeness criteria for abstraction principles that Wright proposes. Thus, we support Boolos against Wright. We also show that, when combined with the axioms for Boolos's iterative notion of set, New V yields a system equivalent to (...)
    Remove from this list   Direct download (10 more)  
     
    Export citation  
     
    Bookmark   50 citations  
  26. John Barwise & Lawrence Moss, Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena[REVIEW]Varol Akman - 1997 - Journal of Logic, Language and Information 6 (4):460-464.
    This is a review of Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena, written by Jon Barwise and Lawrence Moss and published by CSLI Publications in 1996.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  27. Nonstandard set theories and information management.Varol Akman & Mujdat Pakkan - 1996 - Journal of Intelligent Information Systems 6:5-31.
    The merits of set theory as a foundational tool in mathematics stimulate its use in various areas of artificial intelligence, in particular intelligent information systems. In this paper, a study of various nonstandard treatments of set theory from this perspective is offered. Applications of these alternative set theories to information or knowledge management are surveyed.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  28. HYPERSOLVER: a graphical tool for commonsense set theory.Mujdat Pakkan & Varol Akman - 1995 - Information Sciences 85 (1-3):43-61.
    This paper investigates an alternative set theory (due to Peter Aczel) called Hyperset Theory. Aczel uses a graphical representation for sets and thereby allows the representation of non-well-founded sets. A program, called HYPERSOLVER, which can solve systems of equations defined in terms of sets in the universe of this new theory is presented. This may be a useful tool for commonsense reasoning.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29. Issues in commonsense set theory.Mujdat Pakkan & Varol Akman - 1995 - Artificial Intelligence Review 8:279-308.
    The success of set theory as a foundation for mathematics inspires its use in artificial intelligence, particularly in commonsense reasoning. In this survey, we briefly review classical set theory from an AI perspective, and then consider alternative set theories. Desirable properties of a possible commonsense set theory are investigated, treating different aspects like cumulative hierarchy, self-reference, cardinality, etc. Assorted examples from the ground-breaking research on the subject are also given.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  30. On self-membered sets in Quine's set theory NF.Maurice Boffa & André Pétry - 1993 - Logique Et Analyse 141:142.
    Remove from this list  
     
    Export citation  
     
    Bookmark   4 citations  
  31. Undaunted sets.Varol Akman - 1992 - ACM SIGACT News 23 (1):47-48.
    This is a short piece of humor (I hope) on nonstandard set theories. An earlier version appeared in Bull. EATCS 45: 146-147 (1991).
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  32. Russell's set versus the universal set in paraconsistent set theory.A. I. Arruda - 1982 - Logique Et Analyse 25 (98):121.
  33. A Theory of Particular Sets.Paul Blain Levy - manuscript
    ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this problem by speaking only about particular sets.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark