Related papers: On ground model definability

We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its…

The widespread success of foundation models in natural language processing and computer vision has inspired researchers to extend the concept to scientific machine learning and computational science. However, this position paper argues that…

Let $T$ be a complete, model-complete, geometric dp-minimal $\mathcal{L}$-theory of topological fields of characteristic $0$ and let $T(\partial)$ be the theory of expansions of models of $T$ by a derivation $\partial$. We assume that…

Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results in set theory. We show the relative consistency of ZF + DC + there exists a sequence of subsets of R the…

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…

Every crowded space $X$ is ${\omega}$-resolvable in the c.c.c generic extension $V^{Fn(|X|,2})$ of the ground model. We investigate what we can say about ${\lambda}$-resolvability in c.c.c-generic extensions for ${\lambda}>{\omega}$? A…

With infinitely many high-quality data points, infinite computational power, an infinitely large foundation model with a perfect training algorithm and guaranteed zero generalization error on the pretext task, can the model be used for…

We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

It is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for CHCs (CHC solvers) based…

Given a subset of $X\subseteq \mathbb{R}^{n}$ we can associate with every point $x\in \mathbb{R}^{n}$ a vector space $V$ of maximal dimension with the property that for some ball centered at $x$, the subset $X$ coincides inside the ball…

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Follow-up comment by the author: Theorem 2.2 in this paper is a special case of Theorems 1.1 and 4.1 in the article "Weighted thermodynamic formalism on subshifts and applications", Asian J. Math. 16 (2012), by J. Barral and D. J. Feng. In…

Let $\Omega\subset\mathbb{R}^n$ be an open, connected subset of $\mathbb{R}^n$, and let $F\colon\Omega-\Omega\to\mathbb{C}$, where $\Omega-\Omega=\{x-y\colon x,y\in\Omega\}$, be a continuous positive definite function. We give necessary and…

Modified theories of gravity encompass a class of $f(R)$-models that seek to elucidate the observed late time accelerated expansion of the universe. In this study, we examine a set of viable $f(R)$ models (Hu-Sawicki: two cases,…

Several models based on General Relativity and Modified Gravity aim to reproduce the observed universe with precision comparable to the flat-$\Lambda$CDM cosmological model. In this study, we investigate the consistency of some of these…

We present a class of modified-gravity theories which we call ultra-local models. We add a scalar field, with negligible kinetic terms, to the Einstein-Hilbert action. We also introduce a conformal coupling to matter. This gives rise to a…

By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…

Many applications of data-driven models demand transparency of decisions, especially in health care, criminal justice, and other high-stakes environments. Modern trends in machine learning research have led to algorithms that are…

Given a model $\mathcal{M}$ of set theory, and a nontrivial automorphism $j$ of $\mathcal{M}$, let $\mathcal{I}_{\mathrm{fix}}(j)$ be the submodel of $\mathcal{M}$ whose universe consists of elements $m$ of $\mathcal{M}$ such that $j(x)=x$…