THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES (Q5086506)

From MaRDI portal
Revision as of 13:10, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7553653
Language Label Description Also known as
English
THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES
scientific article; zbMATH DE number 7553653

    Statements

    title
    THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES (English)
    0 references
    author
    I. V. Latkin
    0 references
    publication date
    5 July 2022
    0 references
    zbMATH Keywords
    decidable theories
    0 references
    theory of equality
    0 references
    coding of computations
    0 references
    polynomial time
    0 references
    polynomial space
    0 references
    lower complexity bound
    0 references

    Identifiers

    zbMATH DE Number
    7553653
    0 references
    OpenAlex ID
    W4288283913
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5086506&oldid=36826826"
    Powered by MediaWiki