Bounded quantification is undecidable (Q1327694)

From MaRDI portal
Revision as of 21:00, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bounded quantification is undecidable
scientific article

    Statements

    Bounded quantification is undecidable (English)
    0 references
    0 references
    20 June 1994
    0 references
    typed \(\lambda\)-calculus with subtyping and bounded second-order polymorphism
    0 references
    reduction from the halting problem for two-counter Turing machines
    0 references

    Identifiers