Related papers: Remarks on countable tightness
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…
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…
Given a property $P$ of subspaces of a $T_1$ space $X$, we say that $X$ is {\em $P$-bounded} iff every subspace of $X$ with property $P$ has compact closure in $X$. Here we study $P$-bounded spaces for the properties $P \in \{\omega D,…
We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…
We construct a normal countably tight $T_1$ space $X$ with $t(X_\delta) >2^\omega$. This is an answer to the question posed by Dow-Juh\'asz-Soukup-Szentmikl\'ossy-Weiss. We also show that if the continuum is not so large, then the tightness…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
The Grothendieck property has become important in research on the definability of pathological Banach spaces [CI], [HT], and especially [HT20]. We here answer a question of Arhangel'ski\u{\i} by proving it undecidable whether countably…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
A topological space $X$ is $strongly$ $rigid$ if each non-constant continuous map $f:X\to X$ is the identity map of $X$. A Hausdorff topological space $X$ is called $Brown$ if for any nonempty open sets $U,V\subseteq X$ the intersection…
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…
Given a Tychonoff space $X$, let $F(X)$ and $A(X)$ be respectively the free topological group and the free Abelian topological group over $X$ in the sense of Markov. In this paper, we consider two topological properties of $F(X)$ or $A(X)$,…
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.
In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
Michael asked whether every productively Lindel\"of space is powerfully Lindel\"of. Building of work of Alster and De la Vega, assuming the Continuum Hypothesis, we show that every productively Lindel\"of space of countable tightness is…