Related papers: On $\Sigma_1$-Definable Closed Unbounded Sets
A space has $\sigma$-compact tightness if the closures of $\sigma$-compact subsets determines the topology. We consider a dense set variant that we call densely k-separable. We consider the question of whether every densely k-separable…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
For certain theories of existentially closed topological differential fields, we show that there is a strong relationship between $\mathcal L\cup\{D\}$-definable sets and their $\mathcal L$-reducts, where $\mathcal L$ is a relational…
Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…
We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…
A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish…
We continue the study from \cite{BrendleFreidmanMontoya, vandervlugtlocalizationcardinals} of localization cardinals $\mfb_\kappa(\in^*)$ and $\mfd_\kappa(\in^*)$ and their variants at regular uncountable $\kappa$. We prove that if $\kappa$…
We present a direct construction of stationary set preserving forcings that make $\omega$-cofinal all the members of some arbitrary set $\mathcal{K}$ of regular cardinals $\kappa > \omega_1$. In addition, it is made possible to ensure that…
We deal with the problem of preserving various versions of completeness in (< kappa) --support iterations of forcing notions, generalizing the case ``S --complete proper is preserved by CS iterations for a stationary co-stationary S…
Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…
We extend Solovay's theorem about definable subsets of the Baire space to the generalized Baire space ${}^\lambda\lambda$, where $\lambda$ is an uncountable cardinal with $\lambda^{<\lambda}=\lambda$. In the first main theorem, we show that…
Suppose that kappa is a singular cardinal of cofinality omega and GCH holds. Assume that for every n<omega the set of alphas with o(alpha)>= alpha^{+n} is unbounded in kappa.Then there is a cardinal preserving extension satisfying…
Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…
We continue our investigation =of Shelah's interpretability orders $\trianglelefteq^*_\kappa$ as well as the new orders $\trianglelefteq^\times_\kappa$. In particular, we give streamlined proofs of the existence of minimal unstable,…
Let K be a set of infinite cardinals such that the cardinality of K is the first strong limit cardinal greater than uncountably many strong limit cardinals. We construct a family of pairwise non-embeddable groups which contains 2^k groups…
The {\em Singular Cardinal Hypothesis} (SCH) is one of the most classical combinatorial principles in set theory. It says that if $\kappa$ is singular strong limit, then $2^{\kappa}=\kappa^+$. We prove that given a singular cardinal…
We show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then…
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…