Computational complexity of the semantics of some natural language constructions
type: Item
instance of: scholarly article
title: Computational complexity of the semantics of some natural language constructions
zbMATH Open document ID: 1049.03025
author: Marcin Mostowski
author: Dominika Wojtyniak
published in: Annals of Pure and Applied Logic
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 03B65
Mathematics Subject Classification ID: 03C80
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 03A05
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 03C13
zbMATH DE Number: 2083199
zbMATH Keywords: NP-completeness
zbMATH Keywords: PTIME
zbMATH Keywords: Henkin quantifiers
zbMATH Keywords: Edmond's Thesis
zbMATH Keywords: Church's Thesis
MaRDI profile type: Publication
full work available at URL: j.apal.2003.11.016
OpenAlex ID: W1991317290
cites work: On branching quantifiers in English
cites work: Paths, Trees, and Flowers
cites work: Q4198056
cites work: Q5732647
cites work: Quantifiers vs. Quantification Theory
cites work: Q4395559
cites work: Degrees of logics with Henkin quantifiers in poor vocabularies
cites work: Comments on Jaakko Hintikka's paper "Quantifiers vs. Quantification theory"
DOI: 10.1016/J.APAL.2003.11.016
description: scientific article; zbMATH DE number 2083199