-
The first chapter introduces inquisitive semantics as a research
program for the study of the semantics of natural language questions
and disjunctions. The author begins by providing a brief outline of the
necessary background on question semantics and erotetic logics, and
then presents inquisiti...
-
Over the last few years a series of papers has been published that
analyse the computational complexity of solution concepts applied to
different types of coalitional games, which are expressed by more or
less concise representation languages. However, the coalitional games
that have been analyse...
-
In the subarea of (social) choice theory commonly referred to as
ranking sets of objects the question arises whether, given preferences
over some domain, there is a preference relation on the power set of
this domain that is compatible with certain axioms. The Kannai-Peleg
Theorem (Journal of Eco...
-
A set or sequence is random when the pre~x-free Kolmogorov complexity
of its initial segments is relatively high: equal to the length of the
segment (up to a constant). Using Kolmogorov complexity of initial
segments, we can not only de~ne when a set is random, but we can also
compare which of tw...
-
The goal of this master thesis was to explore possible interactions between Hintikka's Interrogative Model of Inquiry (IMI) and Dynamic Epistemic Logics (DELs).
The IMI is a model of inquiry which represents inquiry as an information-seeking process by means of asking questions and drawing infer...
-
Over the last fifty years, the study of non-standard models of
arithmetic has become a fertile and highly technical mathematical
branch. Nevertheless, surprising as it might seem today, the topic of
non-standard models was born as a genuine philosophical issue.
My work sets out to investigate t...
-
PGA, short for ProGram Algebra [PvdZ06, BL02], describes sequential
programs as finite or infinite (repeating) sequences of
instructions. The semigroup C of finite instruction sequences [BP09a]
was introduced as an equally expressive alternative to PGA. PGA
instructions are executed from left to ...
-
Apportionment is the problem of translating an election outcome to a
number of seats in fixed-size political house. Mathematically, the
problem consists of translating a sequence of reals to a sequence of
integers, while ensuring that the sum of the sequence sums to a
pre-determined number. The p...
-
This work concentrates broadly on linguistic theory and the
methodology thereof, criticizes the role intuition plays, and suggests
a gradual replacement of intuition-based data with neurological data
to remedy the problem. It argues that linguists can exploit the
evolutionary design of the brain ...
-
The fields of preference aggregation and judgment aggregation have
strong parallels. In both fields, given certain plausible conditions,
there are no aggregators that can universally output consistent and
complete results. Several methods of avoiding these impossibility
results have been proffered. ...
-
This thesis introduces a novel way of performing temporal binding in a
network of biologically plausible spiking neurons. The neurons in the
network are connected through synapses with short-term synaptic
plasticity. By synchronously activating multiple patterns, the
network stabilizes into a st...