Skip to main content Accessibility help
×
Home
Hostname: page-component-559fc8cf4f-sbc4w Total loading time: 0.676 Render date: 2021-02-25T04:34:14.854Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

A combinatorial forcing for coding the universe by a real when there are no sharps

Published online by Cambridge University Press:  12 March 2014

Saharon Shelah
Affiliation:
The Hebrew University of Jerusalem, Department of Mathematics, Jerusalem, Israel, E-mail: shelah@sunrise.huji.ac.il Rutgers University, Department of Mathematics, New Brunswick, New Jersey 08903, E-mail: shelah@math.rutgers.edu
Lee J. Stanley
Affiliation:
Lehigh University, Department of Mathematics, Bethlehem, PA 18015, E-mail: ljs4@lehigh.edu

Abstract

Assuming 0# does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the Covering Lemma, in various guises), but makes no direct appeal to fine structure itself.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below.

References

[1]Beller, A., Jensen, R., and Welch, P., Coding the universe, London Mathematical Society Lecture Note Series, vol. 47, Cambridge University Press, Cambridge, 1982.CrossRefGoogle Scholar
[2]David, R., Some applications of Jensen's coding theorem, Annals of Mathematical Logic, vol. 22 (1982), pp. 177196.CrossRefGoogle Scholar
[3]David, R., reals, Annals of Pure and Applied Logic, vol. 23 (1982), pp. 121125.Google Scholar
[4]David, R., A functorial singleton, Advances in Mathematics, vol. 74 (1989), pp. 258268.CrossRefGoogle Scholar
[5]Friedman, S., A guide to ‘Coding the universe’ by Beller, Jensen, Welch, this Journal, vol. 50 (1985), pp. 10021019.Google Scholar
[6]Friedman, S., An immune partition of the ordinals, Recursion theory week; proceedings Oberwolfach 1984, Lecture Notes in Mathematics, vol 1121, (Ebbinghaus, H.-D., et al., editors), Springer-Verlag, Berlin, 1985, pp. 141147.Google Scholar
[7]Friedman, S., Strong coding, Annals of Pure and Applied Logic, vol. 35 (1987), pp. 1–98, 99122.CrossRefGoogle Scholar
[8]Friedman, S., Coding over a measurable cardinal, this Journal, vol. 54 (1989), pp. 11451159.Google Scholar
[9]Friedman, S., Minimal coding, Annals of Pure and Applied Logic, vol. 41 (1989), pp. 233297.CrossRefGoogle Scholar
[10]Friedman, S., The -singleton conjecture, Journal of the American Mathematical Society, vol. 3 (1990), pp. 771791.Google Scholar
[11]Friedman, S., A simpler proof of Jensen's coding theorem, Annals of Pure and Applied Logic (to appear).Google Scholar
[12]Friedman, S., A large Π set, absolute for set forcings, Proceedings of the American Mathematical Society, vol. 122 (1994), pp. 253256.Google Scholar
[13]Shelah, S., Proper forcing, Lecture Notes in Mathematics, vol 940, Springer-Verlag, Berlin, 1982.CrossRefGoogle Scholar
[14]Shelah, S., Cardinal arithmetic, Oxford University Press, Oxford (to appear).Google Scholar
[15]Shelah, S. and Stanley, L., Corrigendum to ‘Generalized Martin's axiom and Souslin's hypothesis for higher cardinals’, Israel Journal of Mathematics, vol. 53 (1986), pp. 304314.CrossRefGoogle Scholar
[16]Shelah, S. and Stanley, L., Coding and reshaping when there are no sharps, Set theory of the continuum, Mathematical Sciences Research Institute Publications, vol. 26 (Judah, H., et al.), Springer-Verlag, Berlin, 1992, pp. 407416.CrossRefGoogle Scholar
[17]Shelah, S. and Stanley, L., The combinatorics of combinatorial coding by a real, this Journal, vol. 60 (1994), pp. 3657.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 7 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 25th February 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@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 sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent 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.

A combinatorial forcing for coding the universe by a real when there are no sharps
Available formats
×

Send article to Dropbox

To send 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 use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

A combinatorial forcing for coding the universe by a real when there are no sharps
Available formats
×

Send article to Google Drive

To send 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 use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

A combinatorial forcing for coding the universe by a real when there are no sharps
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *