Computability of the class of strongly constructivizable abelian \(p\)-groups (Q1307188): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:16, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computability of the class of strongly constructivizable abelian \(p\)-groups |
scientific article |
Statements
Computability of the class of strongly constructivizable abelian \(p\)-groups (English)
0 references
28 October 1999
0 references
The class of strongly constructivizable abelian \(p\)-groups (i.e. abelian \(p\)-groups in which the structure of a decidable model can be introduced) and some of its subclasses are proven to be computable. It is also proven that the class is not 2-computable. Some open questions are posed.
0 references
strongly constructivizable group
0 references
decidable group
0 references
abelian \(p\)-group
0 references
\(n\)-computability
0 references
