Computational complexity of the semantics of some natural language constructions

Annals of Pure and Applied Logic

Volumn 127, Issue 1-3 SPEC. ISS., 2004, Pages 219-227

  Mostowski, Marcin ^a   Wojtyniak, Dominika ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Church's Thesis; Edmond's Thesis; Henkin quantifiers; NP completeness; PTIME

Indexed keywords

EID: 2342650887     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2003.11.016     Document Type: Article

References (9)

1. Barwise J. On branching quantifiers in English J. Philos. Logic 8 1979 47-80
2. Edmonds J. Paths, trees, and flowers Canad. J. Math. 17 1965 449-467
3. Garey M.R. Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York
4. L. Henkin, Some remarks on infinitely long formulas, Infinitistic Methods, Pergamon Press, Oxford, 1961, pp. 167-183.
5. Hintikka J. Quantifiers vs. quantification theory Dialectica 27 1973 329-358
6. M. Krynicki, M. Mostowski, Henkin quantifiers, in: M. Krynicki, M. Mostowski, L.W. Szczerba (Eds.), Quantifiers: Logics, Models and Computation, Vol. I, Kluwer Academic Publishers, Dordrecht, 1995, pp. 193-262.
7. M. Mostowski, Kwantyfikatory rozgałȩzione a problem formy logicznej (Branched quantifiers and the problem of logical forms), in: M. Omyła (Ed.), Nauka i jȩzyk, Wydział Filozofii i Socjologii Uniwersytetu Warszawskiego, 1994, pp. 201-241.
8. M. Mostowski, K. Zdanowski, Henkin quantifiers in finite models, in preparation.
9. Stenius E. Comments on Jaakko Hintikka's paper Quantifiers vs. quantification theory Dialectica 30 1976 89-99