scholarly journals NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING

2018 ◽  
Vol 83 (04) ◽  
pp. 1539-1565
Author(s):  
SEAN COX ◽  
JOHN KRUEGER

AbstractWe prove a variation of Easton’s lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle IGMP, GMP together with 2ω ≤ ω2 is consistent with the existence of an ω1-distributive nowhere c.c.c. forcing poset of size ω1. We introduce the idea of a weakly guessing model, and prove that many of the strong consequences of the principle GMP follow from the existence of stationarily many weakly guessing models. Using Namba forcing, we construct a model in which there are stationarily many indestructibly weakly guessing models which have a bounded countable subset not covered by any countable set in the model.

1973 ◽  
Vol 38 (3) ◽  
pp. 460-470 ◽  
Author(s):  
John Gregory

Let A be a countable admissible set (as defined in [1], [3]). The language LA consists of all infinitary finite-quantifier formulas (identified with sets, as in [1]) that are elements of A. Notationally, LA = A ∩ Lω1ω. Then LA is a countable subset of Lω1ω, the language of all infinitary finite-quantifier formulas with all conjunctions countable. The set is the set of Lω1ω sentences defined in 2.2 below. The following theorem characterizes those A-Σ1 sets Φ of LA sentences that have uncountable models.Main Theorem (3.1.). If Φ is an A-Σ1set of LA sentences, then the following are equivalent:(a) Φ has an uncountable model,(b) Φ has a model with a proper LA-elementary extension,(c) for every , ⋀Φ → C is not valid.This theorem was announced in [2] and is proved in §§3, 4, 5. Makkai's earlier [4, Theorem 1] implies that, if Φ determines countable structure up to Lω1ω-elementary equivalence, then (a) is equivalent to (c′) for all , ⋀Φ → C is not valid.The requirement in 3.1 that Φ is A-Σ1 is essential when the set ω of all natural numbers is an element of A. For by the example of [2], then there is a set Φ LA sentences such that (b) holds and (a) fails; it is easier to show that, if ω ϵ A, there is a set Φ of LA sentences such that (c) holds and (b) fails.


Author(s):  
ANDRÉ MACEDO ◽  
RACHEL NEWTON

Abstract Let K/k be an extension of number fields. We describe theoretical results and computational methods for calculating the obstruction to the Hasse norm principle for K/k and the defect of weak approximation for the norm one torus \[R_{K/k}^1{\mathbb{G}_m}\] . We apply our techniques to give explicit and computable formulae for the obstruction to the Hasse norm principle and the defect of weak approximation when the normal closure of K/k has symmetric or alternating Galois group.


2016 ◽  
Vol 152 (7) ◽  
pp. 1435-1475 ◽  
Author(s):  
M. J. Bright ◽  
T. D. Browning ◽  
D. Loughran

Given a family of varieties$X\rightarrow \mathbb{P}^{n}$over a number field, we determine conditions under which there is a Brauer–Manin obstruction to weak approximation for 100% of the fibres which are everywhere locally soluble.


Filomat ◽  
2013 ◽  
Vol 27 (5) ◽  
pp. 875-880
Author(s):  
Yan-Kui Song

A space X is said to be neighborhood star-Lindel?f if for every open cover U of X there exists a countable subset A of X such that for every open O?A, X=St(O,U). In this paper, we continue to investigate the relationship between neighborhood star-Lindel?f spaces and related spaces, and study topological properties of neighborhood star-Lindel?f spaces in the classes of normal and pseudocompact spaces. .


Sign in / Sign up

Export Citation Format

Share Document