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 Russell G. Miller and Andrey S. Morozov and Alexandra A. Soskova and Rose Weisshaar},
  journal={The Journal of Symbolic Logic},
  year={2020},
  volume={87},
  pages={1215 - 1230}
}
Abstract 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 of elements 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… 
1 Citations

Descriptive Set Theory and Computable Topology

This talk presented two classes of topological spaces which play a big role in Computable Analysis, namely CoPolish spaces and effectively Hausdorff spaces, and characterise computability of multivalued functions from computable metric spaces to effectively Hhausdorf spaces.

References

SHOWING 1-10 OF 19 REFERENCES

LOGIC WITH DENUMERABLY LONG FORMULAS AND FINITE STRINGS OF QUANTIFIERS

Stability of nilpotent groups of class 2 and prime exponent

  • A. Mekler
  • Mathematics
    Journal of Symbolic Logic
  • 1981
It is suggested that the problem of characterizing the wo-stable groups is intractable.

A Borel reductibility theory for classes of countable structures

Abstract We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to

BOREL FUNCTORS AND INFINITARY INTERPRETATIONS

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.

A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS

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.

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, and

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.

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 of

b ki ,x ki )) in D ki such that for the tuple (ȳ 1 , . . . ,ȳ ki ) with fb j ,b1 (x j ) =ȳ j , we have (ȳ 1 , . . . ,ȳ ki ) ∈ R i (b 1

  • Hence ∼ is also defined by a generalized computable Σ 1 formula. Let R * i be the set of k i -tuples ((b 1 ,x 1 )
  • 2004