Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T03:21:38.985Z Has data issue: false hasContentIssue false

Forcing minimal degree of constructibility

Published online by Cambridge University Press:  12 March 2014

Haim Judah
Affiliation:
Department of Mathematics, University of California, Berkeley, California 94720Mathematical Sciences Research, Institute Berkeley, California 94720Department of Mathematics, Bar Ilan University, 52-100 Ramat Gan, IsraelInstitute of Mathematics, The Hebrew University, Jerusalem, Israel
Saharon Shelah
Affiliation:
Institute of Mathematics, The Hebrew University, Jerusalem, IsraelDepartment of Mathematics, Rutgers University, New Brunswick, New Jersey 08903

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].

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable