Related papers: Defining Subrings in Finitely Generated Fields of …
Let G be an algebraic group defined over an algebraically closed field k of characteristic zero. We give a simple proof of the following result: if H^1(L, G) = {1} for some finitely generated field extension L/k of transcendence degree \ge…
We prove that the cohomology ring of a finite-dimensional restricted Lie superalgebra over a field of characteristic $p > 2$ is a finitely-generated algebra. Our proof makes essential use of the explicit projective resolution of the trivial…
We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…
We offer a $\forall\exists$-definition for (affine) Campana points over $\mathbb{P}^1_K$ (where $K$ is a number field), which constitute a set-theoretical filtration between $K$ and $\mathcal{O}_{K,S}$ ($S$-integers), which are well-known…
We show that rings of $S$-integers of a global function field $K$ of odd characteristic are first-order universally definable in $K$. This extends work of Koenigsmann and Park who showed the same for $\mathbb{Z}$ in $\mathbb{Q}$ and the…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
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 first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…
For a given number field $K$, we give a $\forall\exists\forall$-first order description of affine Darmon points over $\mathbb{P}^1_K$, and show that this can be improved to a $\forall\exists$-definition in a remarkable particular case.…
We prove that if a finite group scheme $G$ over a field $k$ has essential dimension one, then it embeds in $PGL_{2/k}$. We use this to give an explicit classification of all infinitesimal group schemes of essential dimension one over any…
Every subfield $\kk(\phi)$ of the field of rational functions $\kk(x_1,...,x_n)$ is contained in a unique maximal subfield of the form $\kk(\psi)$. The element $\psi$ is called generative for the element $\phi$. A subfield of…
Let $K$ be a number field, let $L$ be an algebraic (possibly infinite degree) extension of $K$, and let $O_K$ $\subset$ $O_L$ be their rings of integers. Suppose $A$ is an abelian variety defined over $K$ such that $A(K)$ is infinite and…
In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…
Let $K$ be a finitely generated field. We construct an $n$-dimensional linear system $\mathcal{L}$ of hypersurfaces of degree $d$ in $\mathbb{P}^n$ defined over $K$ such that each member of $\mathcal{L}$ defined over $K$ is smooth, under…
We study the existence of finite characterisations for modal formulas. A finite characterisation of a modal formula $\varphi$ is a finite collection of positive and negative examples that distinguishes $\varphi$ from every other,…
We prove that infinite p-adically discrete sets have Diophantine definitions in large subrings of some number fields. First, if K is a totally real number field or a totally complex degree-2 extension of a totally real number field, then…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
We show that for a global field $K$, every ring of $S$-integers has a universal first-order definition in $K$ with $10$ quantifiers. We also give a proof that every finite intersection of valuation rings of $K$ has an existential…