Related papers: Definability via the tilting correspondence
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
We show that a mixed characteristic valuation ring with a value group $\Gamma$, $\val$ its valuation and a residue field of characteristic $p>0$, is a filtered colimit of complete intersection $\bf Z$-algebras if $\Gamma/{\bf Z}\val(p)$ has…
Let $\mathcal{A}$ be an abelian category and $\mathcal{B}$ be the Happel-Reiten-Smal{\o} tilt of $\mathcal{A}$ with respect to a torsion pair. We give necessary and sufficient conditions for the existence of a derived equivalence between…
Linguistic variables represent crisp information in a form and precision appropriate for the problem. For example, to answer the question "How are you?" one may say "I am fine." the linguistic variables like "fine", so common in everyday…
We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…
Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…
Assume that a projective variety is uniformly valuatively stable with respect to a polarization. We show that the projective variety is uniformly valuatively stable with respect to any polarization sufficiently close to the original…
Single-valuedness of the eigenfunctions of the quantised Hitchin Hamiltonians is proposed as a natural quantisation condition. Separation of Variables can be used to relate the classification of eigenstates to the classification of…
We develop a notion of a `canonical $\mathcal{C}$-henselian valuation' for a class $\mathcal{C}$ of field extensions, generalizing the construction of the canonical henselian valuation of a field. We use this to show that the $p$-adic…
A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…
We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…
We present an approach to defining Hilbert spaces of functions depending on infinitely many variables or parameters, with emphasis on a weighted tensor product construction based on stable space splittings, The construction has been used in…
We study fragments of the existential theory of henselian valued fields with parameters. This includes the $\exists_n$-fragment in the equicharacteristic or unramified mixed characteristic case, the $\exists_n\exists_1$-fragment in the…
We explore language semantics for automata combining probabilistic and nondeterministic behavior. We first show that there are precisely two natural semantics for probabilistic automata with nondeterminism. For both choices, we show that…
Elaboration-based type class resolution, as found in languages like Haskell, Mercury and PureScript, is generally nondeterministic: there can be multiple ways to satisfy a wanted constraint in terms of global instances and locally given…
Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.
A method for deriving the asymptotic behaviour of any physical field is presented. This leads to a geometrically meaningful derivation of the peeling properties for arbitrary values of the cosmological constant. Application to the…
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…
Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…