On the isomorphism problem for some classes of computable algebraic structures

, , , &
Archive for Mathematical Logic 61 (5):813-825 (2022)
  Copy   BIBTEX

Abstract

We establish that the isomorphism problem for the classes of computable nilpotent rings, distributive lattices, nilpotent groups, and nilpotent semigroups is \-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.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-021-00811-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Partial automorphism semigroups.Jennifer Chubb, Valentina S. Harizanov, Andrei S. Morozov, Sarah Pingrey & Eric Ufferman - 2008 - Annals of Pure and Applied Logic 156 (2):245-258.
Isomorphism relations on computable structures.Ekaterina B. Fokina, Sy-David Friedman, Valentina Harizanov, Julia F. Knight, Charles Mccoy & Antonio Montalbán - 2012 - Journal of Symbolic Logic 77 (1):122-132.
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.
Classifications of Computable Structures.Karen Lange, Russell Miller & Rebecca M. Steiner - 2018 - Notre Dame Journal of Formal Logic 59 (1):35-59.
The isomorphism problem for computable Abelian p-groups of bounded length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331-345.
The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331 - 345.
Index sets for some classes of structures.Ekaterina B. Fokina - 2009 - Annals of Pure and Applied Logic 157 (2-3):139-147.
Effective algebraicity.Rebecca M. Steiner - 2013 - Archive for Mathematical Logic 52 (1-2):91-112.
Strange Structures from Computable Model Theory.Howard Becker - 2017 - Notre Dame Journal of Formal Logic 58 (1):97-105.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
A Friedberg enumeration of equivalence structures.Rodney G. Downey, Alexander G. Melnikov & Keng Meng Ng - 2017 - Journal of Mathematical Logic 17 (2):1750008.
Categoricity of computable infinitary theories.W. Calvert, S. S. Goncharov, J. F. Knight & Jessica Millar - 2009 - Archive for Mathematical Logic 48 (1):25-38.
On Computability Theoretic Properties of Structures and Their Cartesian Products.Bakhadyr Khoussainov - 2000 - Mathematical Logic Quarterly 46 (4):467-476.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.

Analytics

Added to PP
2022-01-21

Downloads
13 (#1,006,512)

6 months
12 (#203,353)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Valentina Harizanov
George Washington University

Citations of this work

No citations found.

Add more citations

References found in this work

The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.

Add more references