4Rends Ferences Aim Without 0Roposals "Irkhëuser 0
Total Page:16
File Type:pdf, Size:1020Kb
42%.$3).-!4(%-!4)#3 4RENDSIN-ATHEMATICSISASERIESDEVOTEDTOTHEPUBLICATIONOFVOLUMESARISINGFROMCON FERENCESANDLECTURESERIESFOCUSINGONAPARTICULARTOPICFROMANYAREAOFMATHEMATICS)TS AIMISTOMAKECURRENTDEVELOPMENTSAVAILABLETOTHECOMMUNITYASRAPIDLYASPOSSIBLE WITHOUTCOMPROMISETOQUALITYANDTOARCHIVETHESEFORREFERENCE 0ROPOSALSFORVOLUMESCANBESENTTOTHE-ATHEMATICS%DITORATEITHER "IRKHËUSER6ERLAG 0/"OX #( "ASEL 3WITZERLAND OR "IRKHËUSER"OSTON)NC -ASSACHUSETTS!VENUE #AMBRIDGE -! 53! -ATERIALSUBMITTEDFORPUBLICATIONMUSTBESCREENEDANDPREPAREDASFOLLOWS !LLCONTRIBUTIONSSHOULDUNDERGOAREVIEWINGPROCESSSIMILARTOTHATCARRIEDOUTBYJOURNALS ANDBECHECKEDFORCORRECTUSEOFLANGUAGEWHICH ASARULE IS%NGLISH!RTICLESWITHOUT SURVEYPAPERS HOWEVER AREWELCOME 7EEXPECTTHEORGANIZERSTODELIVERMANUSCRIPTSINAFORMTHATISESSENTIALLYREADYFORDIRECT REPRODUCTION!NYVERSIONOF4% ONEPARTICULARDIALECTOF4% HËUSER &URTHERMORE INORDERTOGUARANTEETHETIMELYAPPEARANCEOFTHEPROCEEDINGSITISESSENTIAL EACHARTICLEWILLRECEIVEFREEOFFPRINTS4OTHEPARTICIPANTSOFTHECONGRESSTHEBOOK WILLBEOFFEREDATASPECIALRATE 4OPICSIN#OHOMOLOGICAL3TUDIE3ET4HEORY S OF!LGEBRAIC6ARIETIE#ENTREDE2ECERCA-ATEMÌTICA S "ARCELONA n )MPANGA,ECTURE.OTES 0I-RDQ%DJDULDOTR0RAGACZ %6WHYR7RGRUFHYLFDITOR (GLWRUV "IRKHËUSER6ERLAG "ASELs "OSTON s "ERLIN %D%DITORSITOR 0IOTR0RAGACZ*OAN"AGARIA 3TEVO4ODORCEVIC )NSTITUTEOF-ATHEMATICSOFTHE$EPARTAMENTDE,ÛGICA $EPARTMENTOF-ATHEMATICS 0OLISH!CADEMYOF3CIENCES(ISTÛRIAI&ILOSOlADELA#IÒNCIA 5NIVERSITYOF4ORONTO UL3NIADECKICH5NIVERSITATDE"ARCELONA 4ORONTO -3% #ANADA 0/"OX"ALDIRI2EIXACSN E MAILSTEVO MATHTORONTOEDU 7ARSZAWA"ARCELONA 3PAIN 0OLANDE [email protected] AND E MAILPPRAGACZ IMPANGOVPL 5NIVERSITÏ0ARIS #.23 5-2 0LACE*USSIEU #ASE 0ARIS#EDEX &RANCE - . ! !XX $XX %XX 1 3XX 0 + ( !-ATHEMATICAL3UBJECT#LASSIlCATION%XX /% % #)0CATALOGUERECORDFORTHISBOOKISAVAILABLEFROMTHE % % % ,% %IBRARYOF#ONGRESS 7ASHINGTON$# 53! "!#)0CATALOGUERECORDFORTHISBOOKISAVAILABLEFROMTHEIBLIOGRAPHICINFORMATIONPUBLISHEDBY$IE$EUTSCHE"IBLIOTHEK ,IBRARYOF#ONGRESS 7ASHINGTON$# 53! EDETAILED BIBLIOGRAPHICDATAISAVAILABLEINTHE)NTERNETATHTTPDNBDDBDE "IBLIOGRAPHICINFORMATIONPUBLISHEDBY$IE$EUTSCHE"IBLIOTHEK $IE$EUTSCHE"IBLIOTHEKLISTSTHISPUBLICATIONINTHE$EUTSCHE.ATIONALBIBLIOGRAlEDETAILED BIBLIOGRAPHICDATAISAVAILABLEINTHE)NTERNETATHTTPDNBDDBDE )3". "IRKHËUSER6ERLA G "ASELn"OSTONn"ERLIN 4HISWORKISSUBJECTTOCOPYRIGHT!LLRIGHTSARERESERVED WHETHERTHEWHOLEORPARTOFTHE BANKS&ORANYKINDOFUSEPERMISSIONOFTHECOPYRIGHTOWNERMUSTBEOBTAINED ¥"IRKHËUSER6ERLA G 0/"OX #( "ASEL 3WITZERLAND 0ARTOF3PRINGER3CIENCE "USINESS-EDIA 0RINTEDONACID FREEPAPERPRODUCEDFROMCHLORINE FREEPULP4#& df 0RINTEDIN'ERMANY )3". E )3". )3". WWWBIRKHAUSERCH Contents Foreword ................................................................. vii Survey Papers J. Bagaria, N. Castells and P. Larson AnΩ-logicPrimer ................................................... 1 M. Bekkali and D. Zhani UpperSemi-latticeAlgebrasandCombinatorics ...................... 29 R. Bosch SmallDefinably-largeCardinals ...................................... 55 A. E. Caicedo Real-valued Measurable Cardinals and Well-orderings oftheReals ......................................................... 83 A. Marcone Complexity of Sets and Binary Relations in Continuum Theory: A Survey ............................................................ 121 A.R.D. Mathias WeakSystemsofGandy,JensenandDevlin ......................... 149 B. Tsaban Some New Directions in Infinite-combinatorial Topology . 225 Research Papers T. Banakh and A. Blass The Number of Near-Coherence Classes of Ultrafilters is Either Finite or 2c ................................................... 257 S.-D. Friedman StableAxiomsofSetTheory ........................................ 275 S.-D. Friedman ForcingwithFiniteConditions ....................................... 285 G. Hjorth Subgroups of Abelian Polish Groups . 297 vi Contents P. Koepke and P. Welch OntheStrengthofMutualStationarity .............................. 309 P. Matet Part(κ, λ)andPart∗(κ, λ) ........................................... 321 C. Morgan LocalConnectednessandDistanceFunctions ........................ 345 R. Schindler Bounded Martin’s Maximum and Strong Cardinals . 401 Foreword This is a collection of articles on set theory written by some of the participants in the Research Programme on Set Theory and its Applications that took place at the Centre de Recerca Matem`atica (CRM) in Bellaterra (Barcelona). The Programme run from September 2003 to July 2004 and included an international conference on set theory in September 2003, an advanced course on Ramsey methods in analysis∗ in January 2004, and a joint CRM-ICREA workshop on the foundations of set theory in June 2004, the latter held in Barcelona. A total of 33 short and long term visitors from 15 countries participated in the Programme. This volume consists of two parts, the first containing survey papers on some of the mainstream areas of set theory, and the second containing original research papers. All of them are authored by visitors who took part in the set theory Programme or by participants in the Programme’s activities. The survey papers cover topics as Omega-logic, applications of set theory to lattice theory and Boolean algebras, real-valued measurable cardinals, complexity of sets and relations in continuum theory, weak subsystems of axiomatic set the- ory, definable versions of large cardinals, and selection theory for open covers of topological spaces. As for the research papers, they range from topics such as the number of near-coherence classes of ultrafilters, the consistency strength of bounded forcing axioms, Pκ(λ) combinatorics, some applications of morasses, subgroups of Abelian Polish groups, adding club subsets of ω2 with finite conditions, the consistency strength of mutual stationarity, and new axioms of set theory. We would like to thank all participants in the Programme and its related activities for their effort in making these very successful ventures. We also want to thank the CRM Director and its staff, as well as all the funding institutions, for making the Programme possible. Joan Bagaria Stevo Todorcevic Editors ∗The volume: Spiros A. Argyros and Stevo Todorcevic, Ramsey Methods in Analysis. Advanced Courses in Mathematics CRM Barcelona. Birkh¨auser 2005, contains the notes of the course in an expanded form. Set Theory Trends in Mathematics, 1–28 c 2006 Birkh¨auser Verlag Basel/Switzerland An Ω-logic Primer Joan Bagaria, Neus Castells and Paul Larson Abstract. In [12], Hugh Woodin introduced Ω-logic, an approach to truth in the universe of sets inspired by recent work in large cardinals. Expository accounts of Ω-logic appear in [13, 14, 1, 15, 16, 17]. In this paper we present proofs of some elementary facts about Ω-logic, relative to the published liter- ature, leading up to the generic invariance of Ω-logic and the Ω-conjecture. Keywords. Ω-logic, Woodin cardinals, A-closed sets, universally Baire sets, Ω-conjecture. Introduction One family of results in modern set theory, called absoluteness results,showsthat the existence of certain large cardinals implies that the truth values of certain sen- tences cannot be changed by forcing1. Another family of results shows that large cardinals imply that certain definable sets of reals satisfy certain regularity prop- erties, which in turn implies the existence of models satisfying other large cardinal properties. Results of the first type suggest a logic in which statements are said to be valid if they hold in every forcing extension. With some technical modifica- tions, this is Woodin’s Ω-logic, which first appeared in [12]. Results of the second type suggest that there should be a sort of internal characterization of validity in Ω-logic. Woodin has proposed such a characterization, and the conjecture that it succeeds is called the Ω-conjecture. Several expository papers on Ω-logic and the Ω-conjecture have been published [1, 13, 14, 15, 16, 17]. Here we briefly discuss The first author was partially supported by the research projects BFM2002-03236 of the Minis- terio de Ciencia y Tecnolog´ıa, and 2002SGR 00126 of the Generalitat de Catalunya.Thethird author was partially supported by NSF Grant DMS-0401603. This paper was written during the third author’s stay at the Centre de Recerca Matem`atica (CRM), whose support under a Mobil- ity Fellowship of the Ministerio de Educaci´on, Cultura y Deportes is gratefully acknowledged. It was finally completed during the first and third authors’ stay at the Institute for Mathematical Sciences, National University of Singapore, in July 2005. 1Throughout this paper, by “forcing” we mean “set forcing”. 2 J. Bagaria, N. Castells and P. Larson the technical background of Ω-logic, and prove some of the basic theorems in this area. This paper assumes a basic knowledge of Set Theory, including constructibil- ity and forcing. All undefined notions can be found in [4]. 1. Ω 1.1. Preliminaries Given a complete Boolean algebra B in V , we can define the Boolean-valued model V B by recursion on the class of ordinals On: V B = ∅ 0 B B Vλ = Vβ ,ifλ is a limit ordinal β<λ B { → B | ⊆ B} Vα+1 = f : X X Vα , B B B B Then, V = α∈On Vα . The elements of V are called -names. Every element x of V has a standard B-name xˇ, defined inductively by: ∅ˇ = ∅,andˇx : {yˇ : y ∈ x}→{1B}. ∈ B { ∈ | ∈ B } B For each x V ,letρ(x)=min α On x Vα+1 ,therank of x in V . Given ϕ, a formula of the language of set theory with parameters in V B,we say that ϕ is true in V B if its Boolean-value is 1B, i.e., V B ϕ iff [[ϕ]] B =1B, where [[·]] B is defined by induction