Related papers: An extendible model with a rigid elementary extens…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
It is true in the Cohen generic extension of L, the constructible universe, that every countable ordinal-definable set of reals belongs to L.
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
Let $T$ be an o-minimal theory expanding $\mathrm{RCF}$ and $T_\mathrm{convex}$ be the common theory of its models expanded by predicate for a non-trivial $T$-convex valuation ring. We call an elementary extension $(\mathbb{E}, \mathcal{O})…
It is shown that any finite, rank-connected, dismantlable lattice is lexicographically shellable (hence Cohen-Macaulay). A ranked, interval-connected lattice is shown to be rank-connected, but a rank-connected lattice need not be…
We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…
We study (strong) first countability of locally solid convergence structures on Archimedean vector lattices. Among other results, we characterise those vector lattices for which relatively unform-, order-, and $\sigma$-order convergence,…
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman-Stanley embedding on Scott sentence complexity and show that it only preserves…
A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…
We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…
A relational structure $\mathbb{X}$ is called reversible iff each bijective homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible…
We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
Given a structure $\mathcal{M}$ with a definable topology, its open core is a structure defined on the same universe whose language consists of all open sets of all arities definable in $\mathcal{M}$. In response to questions raised by…
Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a $\Pi_\alpha$ sentence, then there…
The ellipsoidal superpotential of the complex projective plane can be interpreted as a count of rigid rational plane curves of a given degree with one prescribed cusp singularity. In this note we present a closed formula for these counts as…
Let $A$ be a tubular algebra and let $r$ be a positive irrational. Let ${\mathcal D}_r$ be the definable subcategory of $A$-modules of slope $r$. Then the width of the lattice of pp formulas for ${\mathcal D}_r$ is $\infty$. It follows that…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…