Corpus ID: 219965852

Interpreting a field in its Heisenberg group

@article{Alvir2020InterpretingAF,
  title={Interpreting a field in its Heisenberg group},
  author={Rachael Alvir and Wesley Calvert and Grant Goodman and Valentina S. Harizanov and Julia A. Knight and Andrey S. Morozov and Russell G. Miller and Alexandra A. Soskova and Rose Weisshaar},
  journal={arXiv: Logic},
  year={2020}
}
We improve on and generalize a 1960 result of Maltsev. For a field $F$, we denote by $H(F)$ the Heisenberg group with entries in $F$. Maltsev showed that there is a copy of $F$ defined in $H(F)$, using existential formulas with an arbitrary non-commuting pair $(u,v)$ as parameters. We show that $F$ is interpreted in $H(F)$ using computable $\Sigma_1$ formulas with no parameters. We give two proofs. The first is an existence proof, relying on a result of Harrison-Trainor, Melnikov, R. Miller… Expand

References

SHOWING 1-10 OF 20 REFERENCES
A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
TLDR
A new construction of a fully faithful functor is given and it is proved that the functor and its partially defined inverse (restricted to the categories of countable graphs and countable fields) are computable functors. Expand
Borel Functors and Infinitary Interpretations
TLDR
It is shown that for the case of infinitary interpretation the reversals are also true: every Baire-measurable homomorphism between the automorphism groups of two countable structures is induced by an inf initary interpretation. Expand
LOGIC WITH DENUMERABLY LONG FORMULAS AND FINITE STRINGS OF QUANTIFIERS
Publisher Summary This chapter explains logic with denumerably long formulas and finite strings of quantifiers. In making an extension to an infinitary logic, Tarski originally suggested thatExpand
Degree spectra and computable dimensions in algebraic structures
TLDR
This paper shows how to transfer a number of computability-theoretic properties from directed graphs to structures in the following classes: symmetric, irreflexive graphs; partial orderings; lattices; rings; rings (with zero-divisors); integral domains of arbitrary characteristic; commutative semigroups; and 2-step nilpotent groups. Expand
Stability of Nilpotent Groups of Class 2 and Prime Exponent
  • A. Mekler
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1981
TLDR
It is suggested that the problem of characterizing the wo-stable groups is intractable. Expand
COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
Abstract Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, andExpand
Comparing Classes of Finite Structures
We compare classes of structures using the notion of a computable embedding, which is a partial order on the classes of structures. Our attention is mainly, but not exclusively, focused on classes ofExpand
Algorithmic reducibilities of algebraic structures
We describe all possible relations between certain reducibities of algebraic structures which are based on the mass problems of structure presentability.
A Borel Reducibility Theory for Classes of Countable Structures
Computable Structure Theory: Within the Arithmetic
  • 2021
...
1
2
...