Switch to: References

Add citations

You must login to add citations.
  1. The purely iterative conception of set.Ansten Klev - forthcoming - Philosophia Mathematica.
    According to the iterative conception of set, sets are formed in stages. According to the purely iterative conception of set, sets are formed by iterated application of a set-of operation. The cumulative hierarchy is a mathematical realization of the iterative conception of set. A mathematical realization of the purely iterative conception can be found in Peter Aczel’s type-theoretic model of constructive set theory. I will explain Aczel’s model construction in a way that presupposes no previous familiarity with the theories on (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Maddy On The Multiverse.Claudio Ternullo - 2019 - In Stefania Centrone, Deborah Kant & Deniz Sarikaya (eds.), Reflections on the Foundations of Mathematics: Univalent Foundations, Set Theory and General Thoughts. Springer Verlag. pp. 43-78.
    Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Induction–recursion and initial algebras.Peter Dybjer & Anton Setzer - 2003 - Annals of Pure and Applied Logic 124 (1-3):1-47.
    Induction–recursion is a powerful definition method in intuitionistic type theory. It extends inductive definitions and allows us to define all standard sets of Martin-Löf type theory as well as a large collection of commonly occurring inductive data structures. It also includes a variety of universes which are constructive analogues of inaccessibles and other large cardinals below the first Mahlo cardinal. In this article we give a new compact formalization of inductive–recursive definitions by modeling them as initial algebras in slice categories. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • From realizability to induction via dependent intersection.Aaron Stump - 2018 - Annals of Pure and Applied Logic 169 (7):637-655.
    Download  
     
    Export citation  
     
    Bookmark  
  • Inaccessibility in constructive set theory and type theory.Michael Rathjen, Edward R. Griffor & Erik Palmgren - 1998 - Annals of Pure and Applied Logic 94 (1-3):181-200.
    This paper is the first in a series whose objective is to study notions of large sets in the context of formal theories of constructivity. The two theories considered are Aczel's constructive set theory and Martin-Löf's intuitionistic theory of types. This paper treats Mahlo's π-numbers which give rise classically to the enumerations of inaccessibles of all transfinite orders. We extend the axioms of CZF and show that the resulting theory, when augmented by the tertium non-datur, is equivalent to ZF plus (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Regular universes and formal spaces.Erik Palmgren - 2006 - Annals of Pure and Applied Logic 137 (1-3):299-316.
    We present an alternative solution to the problem of inductive generation of covers in formal topology by using a restricted form of type universes. These universes are at the same time constructive analogues of regular cardinals and sets of infinitary formulae. The technique of regular universes is also used to construct canonical positivity predicates for inductively generated covers.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Eta-rules in Martin-löf type theory.Ansten Klev - 2019 - Bulletin of Symbolic Logic 25 (3):333-359.
    The eta rule for a set A says that an arbitrary element of A is judgementally identical to an element of constructor form. Eta rules are not part of what may be called canonical Martin-Löf type theory. They are, however, justified by the meaning explanations, and a higher-order eta rule is part of that type theory. The main aim of this paper is to clarify this somewhat puzzling situation. It will be argued that lower-order eta rules do not, whereas the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Epistemology Versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf.Peter Dybjer, Sten Lindström, Erik Palmgren & Göran Sundholm (eds.) - 2012 - Dordrecht, Netherland: Springer.
    This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice. This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued (...)
    Download  
     
    Export citation  
     
    Bookmark