Computability of the class of strongly constructivizable abelian \(p\)-groups (Q1307188)

From MaRDI portal
Revision as of 14:44, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references