Related papers: On large externally definable sets in NIP
In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"{\i}ss\'{e} limits of classes of finite Steiner triple systems avoiding certain subsystems. The…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
We show that an infinite group is definable in any non trivial geometric $C$-minimal structure which is definably maximal and does not have any definable bijection between a bounded interval and an unbounded one in its canonical tree. No…
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…
A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…
We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…
We consider the compact spaces sigma_n(I) of subsets of an uncountable set I of cardinality at most n and their countable products. We give a complete classification of their Banach spaces of continuous functions and a partial topological…
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…
Assuming the existence of a supercompact cardinal, we construct a model where, for some uncountable regular cardinal $\kappa$, there are no $\Sigma^1_1(\kappa)-\kappa-$mad families.
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
We prove that the cohomology groups of a definably compact set over an o-minimal expansion of a group are finitely generated and invariant under elementary extensions and expansions of the language. We also study the cohomology of the…
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…
We consider integrable Hamiltonian systems in a general setting of invariant submanifolds which need not be compact. For instance, this is the case a global Kepler system, non-autonomous integrable Hamiltonian systems and integrable systems…
We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…
We show that under $\BMM$ and "there exists a Woodin cardinal$"$, the nonstationary ideal on $\omega_1$ can not be defined by a $\Sigma_1$ formula with parameter $A \subset \omega_1$. We show that the same conclusion holds under the…
The main result of the present paper is that $\mathfrak a_g$, the minimal size of maximal cofinitary group, can be of countable cofinality. To prove this we define a natural poset for adding a maximal cofinitary group of a given…