Exhaustible sets in higher-type computation (Q3535608)

From MaRDI portal
Revision as of 10:54, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Exhaustible sets in higher-type computation
scientific article

    Statements

    title
    Exhaustible sets in higher-type computation (English)
    0 references
    publication date
    13 November 2008
    0 references
    zbMATH Keywords
    algorithmic universal quantification
    0 references
    continuous predicate
    0 references
    searchable sets
    0 references
    decidable sets
    0 references
    exhaustible sets
    0 references
    Cantor space
    0 references
    hierarchy of continuous functionals
    0 references

    Identifiers

    zbMATH DE Number
    5365475
    0 references
    OpenAlex ID
    W2151637386
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3535608&oldid=37367493"
    Powered by MediaWiki