Forcing with Δ perfect trees and minimal Δ-degrees

Journal of Symbolic Logic 46 (4):803 - 816 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273229

Links

PhilArchive



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

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 Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Forcing minimal degree of constructibility.Haim Judah & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (3):769-782.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Forcing disabled.M. C. Stanley - 1992 - Journal of Symbolic Logic 57 (4):1153-1175.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Forcing with \triangle perfect trees and minimal \triangle-degrees.Alexander S. Kechris - 1981 - Journal of Symbolic Logic 46 (4):803-816.

Analytics

Added to PP
2009-01-28

Downloads
35 (#443,848)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.

Add more references