Related papers: Ordered henselian valued fields: definability and …
A field $k$ is called geometrically $C_1$ if every smooth projective separably rationally connected $k$-variety has a $k$-rational point. Given a henselian valued field of equal characteristic $0$ with divisible value group, we show that…
In this article we define a new reducibility based on the enumeration orders of r.e. sets.
The relational version of the modal interpretation offers both a consistent quantum ontology and solution for quantum paradoxes within the framework of nonrelativistic quantum mechanics. In the present paper this approach is generalized for…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…
We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…
A poset P is called reversible if every order preserving bijective self map of P is an order automorphism. P is called hereditarily reversible if every subposet of P is reversible. We give a complete characterization of hereditarily…
Recently, Anscombe and Koenigsmann gave an existential 0-definition of the ring of formal power series F[[t]] in its quotient field in the case where F is finite. We extend their method in several directions to give general definability…
A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We extend a construction of Ziegler and (among other…
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.…
We introduce and study in detail the notion of compatibility between valuations and orderings in real hyperfields. We investigate their relation with valuations and orderings induced on factor and residue hyperfields. Much of the theory…
We obtain necessary and sufficient conditions for abelian varieties to acquire semistable reduction over fields of low degree. Our criteria are expressed in terms of torsion points of small order defined over unramified extensions.
We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and $p$-adically closed valued fields. We give an effectiveness condition, related to Hensel's lemma, on a valued…
We develop a theory of integration over valued fields of residue characteristic zero. In particular we obtain new and base-field independent foundations for integration over local fields of large residue characteristic, extending results of…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
We give explicit formulas witnessing IP, \IPn or TP2 in fields with Artin-Schreier extensions. We use them to control $p$-extensions of mixed characteristic henselian valued fields, allowing us most notably to generalize to the \NIPn…
An extension to higher dimensions of the Bel-Debever characterization of the Weyl tensor is considered. This provides algebraic conditions that uniquely determine the multiplicity of a Weyl aligned null direction (WAND), and thus the…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
This paper investigates the learning of 3rd-order tensors representing the semantics of transitive verbs. The meaning representations are part of a type-driven tensor-based semantic framework, from the newly emerging field of compositional…
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…