Results 1  10
of
12
Changing for the Better Preference Dynamics and Agent Diversity
"... ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof.dr. D.C. van den Boom ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Aula der Universiteit op dinsdag 26 februari 2008, te ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof.dr. D.C. van den Boom ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Aula der Universiteit op dinsdag 26 februari 2008, te 12.00 uur door
Comprehension of Simple Quantifiers Empirical Evaluation of a Computational Model
, 2008
"... We compare time needed for understanding different types of quantifiers. In the first study, we show that the distinction between quantifiers recognized by finiteautomata and pushdown automata is psychologically relevant. In the second study, we compare comprehension of pushdown quantifiers in un ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
We compare time needed for understanding different types of quantifiers. In the first study, we show that the distinction between quantifiers recognized by finiteautomata and pushdown automata is psychologically relevant. In the second study, we compare comprehension of pushdown quantifiers in universes with randomly placed objects and those where objects were ordered in some specific way simplifying (with respect to memory resources) computational task. The reaction time in the second case is significantly shorter than in the first case.
Branching quantification vs. twoway quantification
 Journal of Semantics
, 2009
"... We discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require nonlinear 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 line ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require nonlinear 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. 1 Hintikka’s Thesis Jaakko Hintikka (1973) claims that the following sentences essentially require nonlinear quantification for expressing their meaning. (1) Some relative of each villager and some relative of each townsman hate each other. (2) Some book by every author is referred to in some essay by every critic. (3) Every writer likes a book of his almost as much as every critic dislikes some book he has reviewed. Throughout the paper we will refer to sentence (1) as Hintikka sentence. According to Hintikka the interpretation of sentence (1) can be only expressed using Henkin’s quantifier as follows:
Propositional games with explicit strategies
 In Proceedings of the 13th Workshop on Logic, Language, and Computation (WoLLIC
, 2006
"... This paper presents a game semantics for LP, Artemov’s Logic of Proofs. The language of LP extends that of propositional logic by adding formulalabeling terms, permitting us to take a term t and an LP formula A and form the new formula t:A. We define a game semantics for this logic that interprets ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper presents a game semantics for LP, Artemov’s Logic of Proofs. The language of LP extends that of propositional logic by adding formulalabeling terms, permitting us to take a term t and an LP formula A and form the new formula t:A. We define a game semantics for this logic that interprets terms as winning strategies on the formulas they label, so t:A may be read as “t is a winning strategy on A. ” LP may thus be seen as a logic containing inlanguage descriptions of winning strategies on its own formulas. We apply our semantics to show how winnable instances of certain extensive games with perfect information may be embedded into LP. This allows us to use LP to derive a winning strategy on the embedding, from which we can extract a winning strategy on the original, nonembedded game. As a concrete illustration of this method, we compute a winning strategy for a winnable instance of the wellknown game Nim. 1
A Remark on Collective Quantification
, 2007
"... We consider collective quantification in natural language. For many years the common strategy in formalizing collective quantification has been to de ne the meanings of collective determiners, quantifying over collections, using certain typeshifting operations. These typeshifting operations, i.e., ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We consider collective quantification in natural language. For many years the common strategy in formalizing collective quantification has been to de ne the meanings of collective determiners, quantifying over collections, using certain typeshifting operations. These typeshifting operations, i.e., lifts, define the collective interpretations of determiners systematically from the standard meanings of quantifiers. All the lifts considered in the literature turn out to be definable in secondorder logic. We argue that secondorder definable quantifiers are probably not expressive enough to formalize all collective quantification in natural language.
The Computational Complexity of Quantified Reciprocals
, 2008
"... We study the computational complexity of reciprocal sentences with quanti ed antecedents. We observe a computational dichotomy between different interpretations of reciprocity, and shed some light on the status of the socalled Strong Meaning Hypothesis. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study the computational complexity of reciprocal sentences with quanti ed antecedents. We observe a computational dichotomy between different interpretations of reciprocity, and shed some light on the status of the socalled Strong Meaning Hypothesis.
Comprehension of Simple Quanti ers Empirical Evaluation of a Computational Model
, 2008
"... We compare time needed for understanding di erent types of quanti ers. In the rst study, we show that the distinction between quanti ers recognized by niteautomata and pushdown automata is psychologically relevant. In the second study, we compare comprehension of pushdown quanti ers in universes ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We compare time needed for understanding di erent types of quanti ers. In the rst study, we show that the distinction between quanti ers recognized by niteautomata and pushdown automata is psychologically relevant. In the second study, we compare comprehension of pushdown quanti ers in universes with randomly placed objects and those where objects were ordered in some speci c way simplifying (with respect to memory resources) computational task. The reaction time in the second case is signi cantly shorter than in the rst case.
Logic and the Simulation of Interaction and Reasoning: Introductory Remarks.
"... Abstract. This introductory note provides the background for the symposium “Logic and the Simulation of Interaction and Reasoning”, its motivations and the 15 papers presented at the symposium. 1 ..."
Abstract
 Add to MetaCart
Abstract. This introductory note provides the background for the symposium “Logic and the Simulation of Interaction and Reasoning”, its motivations and the 15 papers presented at the symposium. 1
Interpreting Quantifier Combinations  Hintikka's Thesis Revisited
, 2008
"... We discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require nonlinear quantification to express their meaning. Our basic assumption is that a criterion for adequacy of meaning representation is compatibility with sentence truth conditions. This can be establi ..."
Abstract
 Add to MetaCart
We discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require nonlinear quantification to express their meaning. Our basic assumption is that a criterion for adequacy of meaning representation is compatibility with sentence truth conditions. This can be established by observing linguistic behavior of language users. 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 logical and philosophical observations. Moreover, we report on experiments showing that people tend to interpret sentences similar to Hintikka's sentence in a way consistent with our interpretation.