Complexity of Subcases of Presburger Arithmetic (Q3340842)

From MaRDI portal
Revision as of 14:40, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of Subcases of Presburger Arithmetic
scientific article

    Statements

    publication date
    1984
    0 references
    zbMATH Keywords
    complexity of decidable theories
    0 references
    lower bounds for lengths of formulas
    0 references
    Presburger arithmetic
    0 references
    author
    Bruno Scarpellini
    0 references
    title
    Complexity of Subcases of Presburger Arithmetic (English)
    0 references

    Identifiers

    DOI
    10.2307/1999283
    0 references
    Mathematics Subject Classification ID
    03D15
    0 references
    03B25
    0 references
    03C10
    0 references
    68Q25
    0 references
    03F20
    0 references
    zbMATH DE Number
    3873307
    0 references
    OpenAlex ID
    W4249272358
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3340842&oldid=34708186"
    Powered by MediaWiki