Computational complexity of the semantics of some natural language constructions (Q598312): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On branching quantifiers in English / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifiers vs. Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of logics with Henkin quantifiers in poor vocabularies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on Jaakko Hintikka's paper "Quantifiers vs. Quantification theory" / rank
 
Normal rank

Latest revision as of 18:13, 6 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of the semantics of some natural language constructions
scientific article

    Statements

    Computational complexity of the semantics of some natural language constructions (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    NP-completeness
    0 references
    PTIME
    0 references
    Henkin quantifiers
    0 references
    Edmond's Thesis
    0 references
    Church's Thesis
    0 references

    Identifiers

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