English
Related papers

Related papers: First Countable Continua and Proper Forcing

200 papers

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

Logic · Mathematics 2015-03-27 Su Gao , Steve Jackson , Edward Krohne , Brandon Seward

We give a short proof, that can be used in an introductory real analysis course, that if a function that is defined on the set of real numbers is continuous on a countable dense set, then it is continuous on an uncountable set. This is done…

Classical Analysis and ODEs · Mathematics 2023-03-27 Cesar E. Silva , Yuxin Wu

In this article we discuss the relationship between three types of locally convex spaces: docile spaces, Mackey first countable spaces, and sequentially Mackey first countable spaces. More precisely, we show that docile spaces are…

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah

Let $X$ and $Y$ be topological spaces, let $Z$ be a metric space, and let $f: X\times Y\to Z$ be a mapping. It is shown that when $Y$ has a countable base $\mathcal B$, then under a rather general condition on the set-valued mappings $X\ni…

General Topology · Mathematics 2010-10-04 Ahmed Bouziad , Jean-Pierre Troallic

Extending a result of R. de la Vega, we prove that an infinite homogeneous compactum has cardinality $\mathfrak{c}$ if either it is the union of countably many dense or finitely many arbitrary countably tight subspaces. The question if…

General Topology · Mathematics 2016-07-05 István Juhász , Jan van Mill

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…

Data Structures and Algorithms · Computer Science 2014-07-09 Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

Logic in Computer Science · Computer Science 2022-01-11 Thomas Colcombet , Sam van Gool , Rémi Morvan

In this paper we consider the Foreman's maximality principle, which says that any non-trivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We prove that it is…

Logic · Mathematics 2016-04-05 Mohammad Golshani , Yair Hayut

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

A metric space $\mathbf{X}$ is called densely complete if there exists a dense set $D$ in $\mathbf{X}$ such that every Cauchy sequence of points of $D $ converges in $\mathbf{X}$. One of the main aims of this work is to prove that the…

General Topology · Mathematics 2019-01-28 Kyriakos Keremedis , Eliza Wajch

we prove that if $X$ is a locally compact $\sigma$-compact space then on its quotient, $\gamma(X)$ say, determined by the algebra of all real valued bounded continuous functions on $X$, the quotient topology and the completely regular…

General Topology · Mathematics 2008-11-21 Aldo J. Lazar

We show that a linearly ordered topological space is initially \lambda-compact if and only if it is \lambda-bounded, that is, every set of cardinality $\leq \lambda$ has compact closure. As a consequence, every product of initially…

General Topology · Mathematics 2013-07-05 Paolo Lipparini

For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.

Logic · Mathematics 2019-08-06 Yasuo Yoshinobu

We prove that the free locally convex space $L(X)$ over a metrizable space $X$ has countable tightness if and only if $X$ is separable.

General Topology · Mathematics 2014-07-08 S. S. Gabriyelyan

It is shown that CH implies the existence of a compact Hausdorff space that is countable dense homogeneous, crowded and does not contain topological copies of the Cantor set. This contrasts with a previous result by the author which says…

General Topology · Mathematics 2020-01-20 Rodrigo Hernández-Gutiérrez

We show that the forcing axiom for countably compact, $\omega_2$-Knaster, well-met posets is inconsistent. This is supplemental to an inconsistency result of Shelah and sets a new limit to the generalization of Martin's Axiom to the stage…

Logic · Mathematics 2020-08-05 Stevo Todorčević , Shihao Xiong

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

Logic in Computer Science · Computer Science 2022-04-12 Reijo Jaakkola

A space is functionally countable if every real-valued continuous function has countable image. A stronger property recently defined by Tkachuk is exponentially separability. We start by studying these properties in GO spaces, where we…

General Topology · Mathematics 2024-09-27 Rodrigo Hernández-Gutiérrez , Santi Spadaro

Using the concepts of Hyperbolic Classification of Natural Numbers, Essential Regions and Goldbach Conjecture Function we prove that the existence of a proof of the Goldbach Conjecture in First-Order Arithmetic would imply the existence of…

General Mathematics · Mathematics 2007-11-08 Fernando Revilla
‹ Prev 1 4 5 6 7 8 10 Next ›