Coding with canonical functions

Paul B. Larson*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A function f from ω1 to the ordinals is called a canonical function for an ordinal α if f represents α in any generic ultrapower induced by forcing with ℘(ω1)/NSω1.We introduce here a method for coding sets of ordinals using canonical functions from ω1 to ω1. Combining this approach with arguments from [3], we show, assuming the Continuum Hypothesis, that for each cardinal κ there is a forcing construction preserving cardinalities and cofinalities forcing that every subset of κ is an element of the inner model L(℘(ω1)).

Original languageEnglish
Pages (from-to)334-341
Number of pages8
JournalMathematical Logic Quarterly
Volume63
Issue number5
DOIs
StatePublished - Dec 2017

Bibliographical note

Publisher Copyright:
© 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Fingerprint

Dive into the research topics of 'Coding with canonical functions'. Together they form a unique fingerprint.

Cite this