Switch to: References

Add citations

You must login to add citations.
  1. On unfoldable cardinals, ω-closed cardinals, and the beginning of the inner model hierarchy.P. D. Welch - 2004 - Archive for Mathematical Logic 43 (4):443-458.
    Let κ be a cardinal, and let H κ be the class of sets of hereditary cardinality less than κ ; let τ (κ) > κ be the height of the smallest transitive admissible set containing every element of {κ}∪H κ . We show that a ZFC-definable notion of long unfoldability, a generalisation of weak compactness, implies in the core model K, that the mouse order restricted to H κ is as long as τ. (It is known that some weak (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Characterising subsets of ω1 constructible from a real.P. D. Welch - 1994 - Journal of Symbolic Logic 59 (4):1420 - 1432.
    A small large cardinal upper bound in V for proving when certain subsets of ω 1 (including the universally Baire subsets) are precisely those constructible from a real is given. In the core model we find an exact equivalence in terms of the length of the mouse order; we show that $\forall B \subseteq \omega_1 \lbrack B$ is universally Baire $\Leftrightarrow B \in L\lbrack r \rbrack$ for some real r] is preserved under set-sized forcing extensions if and only if there (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Bounded Martin's Maximum, weak Erdӧs cardinals, and ψ Ac.David Asperó & Philip D. Welch - 2002 - Journal of Symbolic Logic 67 (3):1141-1152.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties.I. Sharpe & P. D. Welch - 2011 - Annals of Pure and Applied Logic 162 (11):863-902.
    • We define a notion of order of indiscernibility type of a structure by analogy with Mitchell order on measures; we use this to define a hierarchy of strong axioms of infinity defined through normal filters, the α-weakly Erdős hierarchy. The filters in this hierarchy can be seen to be generated by sets of ordinals where these indiscernibility orders on structures dominate the canonical functions.• The limit axiom of this is that of greatly Erdős and we use it to calibrate (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Bounds on Scott rank for various nonelementary classes.David Marker - 1990 - Archive for Mathematical Logic 30 (2):73-82.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • In memoriam: James Earl Baumgartner (1943–2011).J. A. Larson - 2017 - Archive for Mathematical Logic 56 (7):877-909.
    James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Erdős and set theory.Akihiro Kanamori - 2014 - Bulletin of Symbolic Logic 20 (4):449-490,.
    Paul Erdős was a mathematicianpar excellencewhose results and initiatives have had a large impact and made a strong imprint on the doing of and thinking about mathematics. A mathematician of alacrity, detail, and collaboration, Erdős in his six decades of work moved and thought quickly, entertained increasingly many parameters, and wrote over 1500 articles, the majority with others. Hismodus operandiwas to drive mathematics through cycles of problem, proof, and conjecture, ceaselessly progressing and ever reaching, and hismodus vivendiwas to be itinerant (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Some principles related to Chang's conjecture.Hans-Dieter Donder & Jean-Pierre Levinski - 1989 - Annals of Pure and Applied Logic 45 (1):39-101.
    We determine the consistency strength of the negation of the transversal hypothesis. We also study other variants of Chang's conjecture.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • On the consistency strength of ‘Accessible’ Jonsson Cardinals and of the Weak Chang Conjecture.Hans-Dieter Donder & Peter Koepke - 1983 - Annals of Pure and Applied Logic 25 (3):233-261.
    Download  
     
    Export citation  
     
    Bookmark   15 citations