Related papers: Lofty Models of Peano Arithmetic
We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…
Let $M$ be a 3-manifold. Every knotted (embedded) surface in $M \times \R$ can be moved via an ambient isotopy in such a way that its projection into $M$ is a generic surface. A surface is generic if every point on it is either a regular,…
It is sometimes desirable in choiceless constructions of set theory that one iteratively extends some ground model without adding new sets of ordinals after the first extension. Pushing this further, one may wish to have models $V \subseteq…
The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded…
We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory
We present several new model-theoretic applications of the fact that, under the assumption that there exists a proper class of almost strongly compact cardinals, the powerful image of any accessible functor is accessible. In particular, we…
Lineability is a property enjoyed by some subsets within a vector space X. A subset A of X is called lineable whenever A contains, except for zero, an infinite dimensional vector subspace. If, additionally, X is endowed with richer…
Suppose that a target function is monotonic, namely, weakly increasing, and an original estimate of the target function is available, which is not weakly increasing. Many common estimation methods used in statistics produce such estimates.…
Filliman duality expresses (the characteristic measure of) a convex polytope P containing the origin as an alternating sum of simplices that share supporting hyperplanes with P. The terms in the alternating sum are given by a triangulation…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…
In this paper we prove: Theorem 1. Let $\mathcal{K}$ be an abstract elementary class which satisfies the joint embedding and amalgamation properties. Suppose $\lambda>\mu\geq LS(\mathcal{K})$ and $\theta$ is a limit ordinal $<\lambda^+$. If…
In this paper we address a problem posed by Shelah in 1999 to find a suitable notion for superstability for abstract elementary classes in which limit models of cardinality $\mu$ are saturated. Theorem 1. Suppose that $\mathcal{K}$ is a…
Large Language Models (LLMs) have shown remarkable success on a wide range of math and reasoning benchmarks. However, we observe that they often struggle when faced with unreasonable math problems. Instead of recognizing these issues,…
A conjecture of Batyrev and Manin relates arithmetic properties of varieties with ample anticanonical class to geometric invariants; in particular, counting functions defined by metrized ample line bundles and the corresponding asymptotics…
We introduce the classes of descendingly flexible and descendingly alternative algebras over an arbitrary field $\mathbb{F}$. We suggest a new method based on the sequence of differences between the dimensions of the linear spans of words,…
Continuous functions on the unit interval are relatively tame from the logical and computational point of view. A similar behaviour is exhibited by continuous functions on compact metric spaces equipped with a countable dense subset. It is…
Suppose that $\pi \: Y \to X$ is a finite map of normal varieties over a perfect field of characteristic $p > 0$. Previous work of the authors gave a criterion for when Frobenius splittings on $X$ (or more generally any $p^{-e}$-linear map)…
This paper introduces two complexity-theoretic formulations of Bennett's logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow…
This paper deals with the asymptotic statistical properties of a class of redescending M-estimators in linear models with increasing dimension. This class is wide enough to include popular high breakdown point estimators such as…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…