Forcing Minimal Degree of Constructibility

&
Journal of Symbolic Logic 56 (3):769 (1991)
  Copy   BIBTEX

Abstract

In this paper we will study four forcing notions, two of them giving a minimal degree of constructibility. These constructions give answers to questions in [Ih].

Categories

Keywords

Reprint years

DOI

10.2307/2275046

Links

PhilArchive



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

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

Forcing minimal degree of constructibility.Haim Judah & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (3):769-782.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree.Brooke M. Andersen & Marcia J. Groszek - 2009 - Notre Dame Journal of Formal Logic 50 (2):195-200.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.
Uncountable superperfect forcing and minimality.Elizabeth Theta Brown & Marcia J. Groszek - 2006 - Annals of Pure and Applied Logic 144 (1-3):73-82.
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.
Around random algebra.Haim Judah & Saharon Shelah - 1990 - Archive for Mathematical Logic 30 (3):129-138.
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.
Relational Structures Constructible by Quantifier Free Definable Operations.Saharon Shelah & Mor Doron - 2007 - Journal of Symbolic Logic 72 (4):1283 - 1298.
Sweet & sour and other flavours of ccc forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (5):583-663.
Π10 classes and minimal degrees.Marcia J. Groszek & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 87 (2):117-144.

Analytics

Added to PP
2016-06-30

Downloads
5 (#1,469,565)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Combinatorics and forcing with distributive ideals.Pierre Matet - 1997 - Annals of Pure and Applied Logic 86 (2):137-201.

Add more citations

References found in this work

No references found.

Add more references