- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the isomorphism problem for some classes of computable algebraic structures
Archive for Mathematical Logic 61 (5):813-825 (2022)
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.Author's Profile
Other Versions
No versions found
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.
Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.
The isomorphism problem for computable Abelian p-groups of bounded length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331-345.
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 Computable Abelian p-Groups of Bounded Length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331 - 345.
Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
Classifications of Computable Structures.Karen Lange, Russell Miller & Rebecca M. Steiner - 2018 - Notre Dame Journal of Formal Logic 59 (1):35-59.
Index sets for some classes of structures.Ekaterina B. Fokina - 2009 - Annals of Pure and Applied Logic 157 (2-3):139-147.
Analytics
Added to PP
2022-01-21
Downloads
25 (#865,724)
6 months
9 (#449,585)
2022-01-21
Downloads
25 (#865,724)
6 months
9 (#449,585)
Historical graph of downloads
Author's Profile
References found in this work
Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
A borel reducibility theory for classes of countable structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.
Degree spectra of relations on structures of finite computable dimension.Denis R. Hirschfeldt - 2002 - Annals of Pure and Applied Logic 115 (1-3):233-277.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-2pm92 dc2