Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-the-isomorphism-problem-for-some-classes-of-computable-algebraic-UDvf52Xn0h
References (14)
-
V. Dyson (1965)
Review: A. I. Mal'cev, (Ob odnorn sootvetstvii mezdu kol'cami i grupparni):On a Correspondence Between Rings and GroupsJournal of Symbolic Logic, 30
-
(1998)
Groups of computable automorphisms -
Joseph Harrison (1968)
Recursive pseudo-well-orderingsTransactions of the American Mathematical Society, 131
-
J. Barwise (1975)
Admissible sets and structures -
H. Friedman, L. Stanley (1989)
A Borel reductibility theory for classes of countable structuresJournal of Symbolic Logic, 54
-
W. Calvert (2002)
The isomorphism problem for classes of computable fieldsArchive for Mathematical Logic, 43
-
S. Goncharov, J. Knight (2002)
Computable Structure and Non-Structure TheoremsAlgebra and Logic, 41
-
The undecidability of some simple theories (unpublished manuscript) Steffen Lempp -
S. Goncharov, V. Harizanov, J. Knight, A. Morozov, A. Romina (2005)
On Automorphic Tuples of Elements in Computable ModelsSiberian Mathematical Journal, 46
-
DR Hirschfeldt, BM Khoussainov, RA Shore, AM Slinko (2002)
Degree spectra and computable dimension in algebraic structuresAnn. Pure Appl. Logic, 115
-
D. Hirschfeldt, B. Khoussainov, R. Shore, A. Slinko (2002)
Degree spectra and computable dimensions in algebraic structuresAnn. Pure Appl. Log., 115
-
R. Downey, A. Montalbán (2008)
THE ISOMORPHISM PROBLEM FOR TORSION-FREE ABELIAN GROUPS IS ANALYTIC COMPLETE.Journal of Algebra, 320
-
W. Calvert, D. Cenzer, V. Harizanov, A. Morozov (2006)
Effective categoricity of equivalence structuresAnn. Pure Appl. Log., 141
-
A. Morozov (1993)
Functional trees and automorphisms of modelsAlgebra and Logic, 32
- Publisher
- Springer Journals
- Copyright
- Copyright © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-021-00811-5
- Publisher site
- See Article on Publisher Site
Abstract
We establish that the isomorphism problem for the classes of computable nilpotent rings, distributive lattices, nilpotent groups, and nilpotent semigroups is Σ11\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\Sigma _{1}^{1}$$\end{document}-complete, which is as complicated as possible. The method we use is based on uniform effective interpretations of computable binary relations into computable structures from the corresponding algebraic classes.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Jul 1, 2022
Keywords: Isomorphism problem; Computable structure; Nilpotent structure; Distributive lattice; Effective transformation; Primary 03C57; Secondary 03D45