Exhaustible sets in higher-type computation (Q3535608)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Exhaustible sets in higher-type computation
scientific article

    Statements

    Exhaustible sets in higher-type computation (English)
    0 references
    13 November 2008
    0 references
    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