A proof of Hechler's theorem on embedding \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\aleph_1$\end{document}-directed sets cofinally into \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $(\omega^\omega,<^*)$\end{document} [Book Review]

Archive for Mathematical Logic 36 (6):399-403 (1997)
  Copy   BIBTEX

Abstract

We give a proof of Hechler's theorem that any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\aleph_1$\end{document}-directed partial order can be embedded via a ccc forcing notion cofinally into \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\omega^\omega$\end{document} ordered by eventual dominance. The proof relies on the standard forcing relation rather than the variant introduced by Hechler.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Frames and MV-Algebras.Lawrence P. Belluce & Antonio Di Nola - 2005 - Studia Logica 81 (3):357 - 385.
The consistency strength of choiceless failures of SCH.Arthur W. Apter & Peter Koepke - 2010 - Journal of Symbolic Logic 75 (3):1066-1080.
Independently Axiomatizable [image] Theories.Greg Hjorth & Ioannis A. Souldatos - 2009 - Journal of Symbolic Logic 74 (4):1273 - 1286.
On a result of Szemerédi.Albin L. Jones - 2008 - Journal of Symbolic Logic 73 (3):953-956.
On sets of relations definable by addition.James F. Lynch - 1982 - Journal of Symbolic Logic 47 (3):659-668.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
The amalgamation spectrum.John T. Baldwin, Alexei Kolesnikov & Saharon Shelah - 2009 - Journal of Symbolic Logic 74 (3):914-928.
Almost everywhere domination.Natasha L. Dobrinen & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (3):914-922.

Analytics

Added to PP
2013-10-30

Downloads
14 (#993,531)

6 months
4 (#796,002)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Hechler’s theorem for the null ideal.Maxim R. Burke & Masaru Kada - 2004 - Archive for Mathematical Logic 43 (5):703-722.
Hechler's theorem for tall analytic p-ideals.Barnabás Farkas - 2011 - Journal of Symbolic Logic 76 (2):729 - 736.

Add more citations

References found in this work

No references found.

Add more references