The complexity of definability by open first-order formulas (Q3386916)

From MaRDI portal
Revision as of 19:51, 15 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The complexity of definability by open first-order formulas
scientific article

    Statements

    title
    The complexity of definability by open first-order formulas (English)
    0 references
    author
    Carlos Areces
    0 references
    Daniel Penazzi
    0 references
    Pablo Ventura
    0 references
    Miguel A. Campercholi
    0 references
    publication date
    8 January 2021
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    03C07
    0 references
    03C13
    0 references
    68Q27
    0 references
    zbMATH DE Number
    7291123
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3386916&oldid=21421675"
    Powered by MediaWiki