Related papers: On definable Skolem functions and trichotomy
As the prototypical category, $\mathbf{Set}$ has many properties which make it special amongst categories. From the point of view of mathematical logic, one such property is that $\mathbf{Set}$ has enough structure to "properly" formalise…
We prove that for p-optimal fields (a very large subclass of p-minimal fields containing all the known examples) a cell decomposition theorem follows from methods going back to Denef's paper [Invent. Math, 77 (1984)]. We derive from it the…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
Suppose that ${\mathcal M}$ is a model of PA and ${\mathcal N}$ is a countably generated elementary end extension of ${\mathcal M}$. Let ${\mathfrak X}$ be the set of subsets of M that are coded by ${\mathcal N}$. Then ${\mathcal M}$ has a…
We give a new definition of the derived category of constructible $\ell$-adic sheaves on a scheme, which is as simple as the geometric intuition behind them. Moreover, we define a refined fundamental group of schemes, which is large enough…
In this paper, without the axiom of choice, we show that if a certain downward L\"owenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is forceable if and only if the universe is a…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…
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…
Every o-minimal expansion R-tilde of the real field has an o-minimal expansion P(R-tilde) in which the solutions to Pfaffian equations with definable C^1 coefficients are definable.
We establish a precise relation between M, a subsystem of the formal axiomatic system of intuitionistic analysis FIM of S. C. Kleene, and elementary analysis EL of A. S. Troelstra, two weak formal systems of two-sorted intuitionistic…
This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…
Let N be an o-minimal expansion of a real closed field. We develop cohomology theory for the category of N-definable manifolds and N-definable maps, and use this to solve the Peterzil-Steinhorn problem on the existence of torsion points on…
We introduce the Hausdorff measure for definable sets in an o-minimal structure, and prove the Cauchy-Crofton and co-area formulae for the o-minimal Hausdorff measure. We also prove that every definable set can be partitioned into "basic…
In this paper we introduce a new homology theory devoted to the study of families such as semi-algebraic or subanalytic families and in general to any family definable in an o-minimal structure (such as Denjoy-Carleman definable or $ln-exp$…
In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…
In this paper, we present explicit expressions for conforming finite element function spaces, basis functions, and degrees of freedom on the pentatope and tetrahedral prism elements. More generally, our objective is to construct finite…
This first part of the paper describes the support of top graded local cohomology modules. As a corrolary one obtains a simple criteria for the vanishing of these modules and also the fact that they have finitely many minimal primes. 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…