Computational complexity of the semantics of some natural language constructions (Q598312)
From MaRDI portal
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
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
