Skip to main content Accessibility help
×
Home
Hostname: page-component-7f7b94f6bd-8mfwn Total loading time: 0.376 Render date: 2022-06-29T11:08:24.601Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Weakly compact cardinals: A combinatorial proof

Published online by Cambridge University Press:  12 March 2014

S. Shelah*
Affiliation:
Hebrew University, Jerusalem, Israel University of Californiaat Berkeley, Berkeley, California 94720

Extract

We give here a direct purely combinatorial proof that weak compactness is equivalent to a combinatorial property (2). This property (2) is apparently stronger, and from it, all other usual equivalent definitions and usual properties of weakly compact cardinals can be deduced. So this proof may be useful for books which want to present weakly compact cardinals, but not logic.

A direct simple proof of a weaker implication (e.g., weakly compact μ is not the first inaccessible, and every stationary set has an initial segment which is stationary) was given by Kunen [K] and independently by the author [Sh]. Baumgartner [B] had another proof.

We were motivated by the manuscript of Erdös, Hajnal, Mate and Rado's book on partition calculus, and by conversations with A. Levi who was writing a book on naive set theory.

Notation. Let i, j, α, β, γ, η, σ be ordinals, μ be a cardinal, f, g be functions.

Let cf α be the cofinality of α.

A partially ordered set T is a tree if for any aT, {b: b < a, bT} is well ordered; its order type (an ordinal) is called the level of a, and Tα is the set of aT of level a.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[B]Baumgartner, J., Ineffability properties of cardinals. II.Google Scholar
[K]Kunen, K., Combinatorics, Handbook of Mathematical Logic (Barwise, J., Editor), North-Holland, Amsterdam, 1977, pp. 430445.Google Scholar
[Sh]Shelah, S., Remarks to the book on partition calculus of Erdös, Hajnal, Mate and Rado, mimeograph, 01 1976.Google Scholar
11
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Weakly compact cardinals: A combinatorial proof
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Weakly compact cardinals: A combinatorial proof
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Weakly compact cardinals: A combinatorial proof
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *