We consider an example of a sentence which according to Hintikka's claim essentially requires for its logical form a Henkin quantifier. We show that if Hintikka is right then recognizing the truth value of the sentence in finite models is an NP-complete problem. We discuss also possible conclusions from this observation.

The examination of quantifiers plays an essential role in modern linguistic theories. One of the most important issues in this respect was raised by Jaakko Hintikka, who proposed the following thesis: Certain natural language sentences require essential non-linear quantification to adequately express their logical form.

Next SectionWe discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require non-linear quantification to express their meaning. We investigate sentences with combinations of quantifiers similar to Hintikka's examples and propose a novel alternative reading expressible by linear formulae. This interpretation is based on linguistic and logical observations. We report on our experiments showing that people tend to interpret sentences similar to Hintikka sentence in a way consistent with our interpretation.

In this paper I shall attempt to compare the dialogue approach originally advocated by Lorenz and Lorenzen and the game-theoretical approach of Hintikka with each other. I shall not try to present any survey of either one of the approaches and will assume that the reader is familiar with the basic ideas of these theories.The original works of Lorenzen and Lorenz have been reprinted in their while Stegmüller contains a survey (in English) of the basic ideas and results. Works in (...) this tradition which apply the approach to quantum logic include Denecke, Mittelstaedt Mittelstaedt and Stachow, Stachow. The reader will also find van Dunn, Krabbe, Lorenz and Stachow to be relevant.The literature on Hintikka’s game-theoretical semantics as applied both to different formal languages (including infinitary languages and intensional logic) and to natural language is rapidly growing. As for the latter, the reader is referred to papers by Hintikka, Carlson and myself reprinted in Saarinen, to Carlson and ter Meulen, and to Saarinen. (shrink)

Branching quantifiers were first introduced by L. Henkin in his 1959 paper ‘Some Remarks on Infmitely Long Formulas’. By ‘branching quantifiers’ Henkin meant a new, non-linearly structured quantiiier-prefix whose discovery was triggered by the problem of interpreting infinitistic formulas of a certain form} The branching (or partially-ordered) quantifier-prefix is, however, not essentially infinitistic, and the issues it raises have largely been discussed in the literature in the context of finitistic logic, as they will be here. Our discussion transcends, however, the (...) resources of standard lst-order languages and we will consider the new form in the context of 1st-order logic with 1- and 2-place ‘Mostowskian` generalized quantifiers.2.. (shrink)