A minimal degree which collapses ω1

, &
Journal of Symbolic Logic 49 (1):298-300 (1984)
  Copy   BIBTEX

Abstract

We consider a well-known partial order of Prikry for producing a collapsing function of minimal degree. Assuming MA + ≠ CH, every new real constructs the collapsing map.

Categories

Keywords

Reprint years

DOI

10.2307/2274111

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

My notes

Similar books and articles

A Minimal Degree Which Collapses $omega_1$.Tim Carlson, Kenneth Kunen & Arnold W. Miller - 1984 - Journal of Symbolic Logic 49 (1):298-300.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.
The minimal e-degree problem in fragments of Peano arithmetic.M. M. Arslanov, C. T. Chong, S. B. Cooper & Y. Yang - 2005 - Annals of Pure and Applied Logic 131 (1-3):159-175.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Π10 classes and minimal degrees.Marcia J. Groszek & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 87 (2):117-144.
Minimal Complements for Degrees below 0´.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937 - 966.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Properly Σ2 minimal degrees and 0″ complementation.S. Barry Cooper, Andrew E. M. Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
Minimal groups in separably closed fields.E. Bouscaren & F. Delon - 2002 - Journal of Symbolic Logic 67 (1):239-259.
Intervals containing exactly one c.e. degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
Forcing minimal degree of constructibility.Haim Judah & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (3):769-782.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
2-Minimality, jump classes and a note on natural definability.Mingzhong Cai - 2014 - Annals of Pure and Applied Logic 165 (2):724-741.

Analytics

Added to PP
2009-01-28

Downloads
218 (#89,123)

6 months
12 (#200,125)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Perfect tree forcings for singular cardinals.Natasha Dobrinen, Dan Hathaway & Karel Prikry - 2020 - Annals of Pure and Applied Logic 171 (9):102827.

Add more citations

References found in this work

No references found.

Add more references