The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar (Q1285872)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
scientific article

    Statements

    The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar (English)
    0 references
    0 references
    0 references
    0 references
    31 August 1999
    0 references
    constraint logics
    0 references
    speciate re-entrant logic
    0 references
    head-driven phrase structure grammar
    0 references
    modellability in a signature
    0 references
    complexity of modellability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references