NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING
type: Item
instance of: scholarly article
title: NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING
zbMATH Open document ID: 1477.03178
author: John Krueger
author: Sean Cox
publication date: 2019-01-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/1610.00319
Mathematics Subject Classification ID: 03E05
Mathematics Subject Classification ID: 03E35
Mathematics Subject Classification ID: 03E40
Mathematics Subject Classification ID: 03E55
Mathematics Subject Classification ID: 03E65
zbMATH DE Number: 6997552
zbMATH Keywords: weak \(\omega_{1}\)-approximation property
zbMATH Keywords: weak \(\omega_{1}\)-guessing
zbMATH Keywords: wGMP
zbMATH Keywords: forcing axioms
zbMATH Keywords: Namba forcing
MaRDI profile type: Publication
OpenAlex ID: W3098624263
arXiv ID: 1610.00319
cites work: Quotients of strongly proper forcings and guessing models
cites work: Indestructible guessing models and the continuum
cites work: Iterated Forcing and Elementary Embeddings
cites work: Ideals and Generic Elementary Embeddings
cites work: Martin's maximum, saturated ideals, and nonregular ultrafilters. I
cites work: Extensions with the approximation and cover properties have no new large cardinals
cites work: Internally club and approachable
cites work: Separating stationary reflection principles
cites work: On the Hamkins approximation property
cites work: Q5678856
cites work: Q4375363
cites work: Some Combinatorial Properties of Trees
cites work: Guessing models and generalized Laver diamond
cites work: On the consistency strength of the proper forcing axiom
cites work: The combinatorial essence of supercompactness
cites work: Q5748195
Wikidata QID: Q128715420
DOI: 10.1017/JSL.2018.30
published in: Journal of Symbolic Logic
description: scientific article; zbMATH DE number 6997552