Related papers: Hanf Number for Scott Sentences of Computable Stru…

A cuf space (set, resp.) is a space (set, resp.) which is a countable union of finite subspaces (subsets, resp.). It is proved in $\mathbf{ZF}$ (with the absence of the axiom of choice) that all countable unions of cuf (denumerable, resp.)…

We show that there exist infinitely many $n \in \mathbb{Z}^+$ such that for any constant $\epsilon > 0$, any deterministic algorithm to solve $k$-\textsf{SAT} for $k \geq 3$ must perform at least…

We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Let $ \kappa , \theta < \lambda$ be cardinals, with $\lambda$ and $\kappa$ regular. Concentrating on a simple case, we say that the triple $(\lambda,\kappa,\theta)$ has a Super Black Box when the following holds. For some stationary $S…

Given a Banach space we consider the $\sigma$-ideal of all of its subsets which are covered by countably many hyperplanes and investigate its standard cardinal characteristics as the additivity, the covering number, the uniformity, the…

Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to…

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.

The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is…

We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…

The spectrum of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we study the hierarchy of first-order spectra based on the number of variables. It has been conjectured…

Inspired by recent work of A. Mardani which elaborates on the elementary fact that for any continuous function $f:\omega_1\times\mathbb{R}\to\mathbb{R}$, there is an $\alpha\in\omega_1$ such that $f(\langle\beta,x\rangle) =…

Hellsten \cite{MR2026390} proved that when $\kappa$ is $\Pi^1_n$-indescribable, the \emph{$n$-club} subsets of $\kappa$ provide a filter base for the $\Pi^1_n$-indescribability ideal, and hence can also be used to give a characterization of…

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

We consider special subclasses of the class of Lindel\"of Sigma-spaces obtained by imposing restrictions on the weight of the elements of compact covers that admit countable networks: A space $X$ is in the class $L\Sigma(\leq\kappa)$ if it…

Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…

In a recent paper (Cucker, Krick, Malajovich and Wschebor, A Numerical Algorithm for Zero Counting. I: Complexity and accuracy, J. Compl.,24:582-605, 2008) we analyzed a numerical algorithm for computing the number of real zeros of a…

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…

Given infinite cardinals $\theta\leq \kappa$, we ask for the minimal VC-dimension of a cofinal family $\mathcal{F}\subseteq[\kappa]^{<\theta}$. We show that for $\theta=\omega$ and $\kappa=\aleph_n$ it is consistent with ZFC that there…

For a cardinal $\kappa > \omega$ a metric space $X$ is called to be $\kappa$-superuniversal whenever for every metric space $Y$ with $|Y| < \kappa$ every partial isometry from a subset of $Y$ into $X$ can be extended over the whole space…