Related papers: The Cardinality of the second uniform indiscernibl…
We describe a family of open subsets $M_A$ of the Moore plane, one for each subset $A$ of $\mathbb{R}$. Each of these subsets is a separable contractible (Hausdorff) 2-manifold, which is nonmetrizable if $A$ is uncountable. The collection…
An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…
Suppose that there is a measurable cardinal. If \aleph_\omega is a strong limit cardinal, but the power of \aleph_\omega is bigger than \aleph_{\omega_1}, then there is an inner model with a Woodin cardinal. Modulo the need of the…
Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…
Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of…
Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…
This is part I of a study on cardinals that are characterizable by Scott sentences. Building on [3], [6] and [1] we study which cardinals are characterizable by a Scott sentence $\phi$, in the sense that $\phi$ characterizes $\kappa$, if…
Assuming three strongly compact cardinals, it is consistent that \[ \aleph_1 < \mathrm{add}(\mathrm{null}) < \mathrm{cov}(\mathrm{null}) < \mathfrak{b} < \mathfrak{d} < \mathrm{non}(\mathrm{null}) < \mathrm{cof}(\mathrm{null}) <…
To answer a question by Rettich and Serafin, we define a model of set theory in which there exists a locally countable $\varPi^1_2$ graph on a subset of the real line, which is not generated by a countable family of projective (or even…
A sibling of a relational structure $R$ is any structure $S$ which can be embedded into $R$ and, vice versa, in which $R$ can be embedded. Let $sib(R)$ be the number of siblings of $R$, these siblings being counted up to isomorphism.…
In [CMRM24], it was proved that it is relatively consistent that \emph{bounding number} $\mathfrak{b}$ is smaller than the uniformity of $\mathcal{MA}$, where $\mathcal{MA}$ denotes the ideal of the meager-additive sets of $2^{\omega}$. To…
In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an…
Harary and Lauri conjectured that the class reconstruction number of trees is 2, that is, each tree has two unlabelled vertex-deleted subtrees that are not both in the deck of any other tree. We show that each tree $T$ can be reconstructed…
We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…
Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…