scholarly journals RIGIDITY OF CONTINUOUS QUOTIENTS

2014 ◽  
Vol 15 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Ilijas Farah ◽  
Saharon Shelah

We study countable saturation of metric reduced products and introduce continuous fields of metric structures indexed by locally compact, separable, completely metrizable spaces. Saturation of the reduced product depends both on the underlying index space and the model. By using the Gelfand–Naimark duality we conclude that the assertion that the Stone–Čech remainder of the half-line has only trivial automorphisms is independent from ZFC (Zermelo-Fraenkel axiomatization of set theory with the Axiom of Choice). Consistency of this statement follows from the Proper Forcing Axiom, and this is the first known example of a connected space with this property.

2005 ◽  
Vol 05 (01) ◽  
pp. 87-97 ◽  
Author(s):  
JUSTIN TATCH MOORE

In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2ω = ω2 and that [Formula: see text] satisfies the Axiom of Choice. It will also be demonstrated that this reflection principle implies that □(κ) fails for all regular κ > ω1.


Author(s):  
Kyriakos Keremedis ◽  
Eleftherios Tachtsis ◽  
Eliza Wajch

AbstractIn the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $$\mathbf {ZF}$$ ZF , some are shown to be independent of $$\mathbf {ZF}$$ ZF . For independence results, distinct models of $$\mathbf {ZF}$$ ZF and permutation models of $$\mathbf {ZFA}$$ ZFA with transfer theorems of Pincus are applied. New symmetric models of $$\mathbf {ZF}$$ ZF are constructed in each of which the power set of $$\mathbb {R}$$ R is well-orderable, the Continuum Hypothesis is satisfied but a denumerable family of non-empty finite sets can fail to have a choice function, and a compact metrizable space need not be embeddable into the Tychonoff cube $$[0, 1]^{\mathbb {R}}$$ [ 0 , 1 ] R .


2018 ◽  
Vol 6 (1) ◽  
pp. 26-33
Author(s):  
Olena Karlova ◽  
Volodymyr Mykhaylyuk

Abstract We prove that if X is a paracompact connected space and Z = ∏s∈S Zs is a product of a family of equiconnected metrizable spaces endowed with the box topology, then for every Baire-one map g : X → Z there exists a separately continuous map f : X2 → Z such that f (x, x) = g(x) for all x ∈ X.


1995 ◽  
Vol 60 (2) ◽  
pp. 431-443 ◽  
Author(s):  
Peter Nyikos ◽  
Leszek Piątkiewicz

AbstractWe prove that a number of axioms, each a consequence of PFA (the Proper Forcing Axiom) are equivalent. In particular we show that TOP (the Thinning-out Principle as introduced by Baumgartner in the Handbook of set-theoretic topology), is equivalent to the following statement: If I is an ideal on ω1 with ω1 generators, then there exists an uncountable X ⊆ ω1, such that either [X]ω ∩ I = ∅ or [X]ω ⊆ I.


2011 ◽  
Vol 76 (4) ◽  
pp. 1126-1136 ◽  
Author(s):  
Andrés Eduardo Caicedo ◽  
Sy-David Friedman

AbstractIf the bounded proper forcing axiom BPFA holds and ω1 = ω1L, then there is a lightface Σ31 well-ordering of the reals. The argument combines a well-ordering due to Caicedo-Veličković with an absoluteness result for models of MA in the spirit of “David's trick.” We also present a general coding scheme that allows us to show that BPFA is equiconsistent with R being lightface Σ41 for many “consistently locally certified” relations R on ℝ. This is accomplished through a use of David's trick and a coding through the Σ2 stable ordinals of L.


2008 ◽  
Vol 73 (3) ◽  
pp. 845-860 ◽  
Author(s):  
Victoria Gitman

AbstractSome 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and Nadel extended his result to Scott sets of size ω1. Here, I show that assuming the Proper Forcing Axiom (PFA), every A-proper Scott set is the standard system of a model of PA. I define that a Scott set is proper if the quotient Boolean algebra /Fin is a proper partial order and A-proper if is additionally arithmetically closed. I also investigate the question of the existence of proper Scott sets.


2013 ◽  
Vol 59 (3) ◽  
pp. 219-229 ◽  
Author(s):  
Vinicius Cifú Lopes

Sign in / Sign up

Export Citation Format

Share Document