-
This work argues that partition semantics can be extended to cover
why-questions and their answers, and then develops such an
extension. Building on Jeroen Groenendijk’s Logic of Interrogation and
incorporating a theory of why-questions initially put forward by Bas
van Fraassen, it provides a uni...
-
Concentrating on different theories of time, this thesis takes as a
starting point the A-series and the B-series as presented by McTaggart
(1908), and as used by philosophers of time during the last century. I
will conclude that both of these series are, not only compatible, but
necessary for the...
-
Aumann's agreeing to disagree theorem is a central theorem of game
theory. This result says that if two agents have a common prior, then
they cannot agree (have common knowledge of their posteriors) to
disagree (while these posteriors are not identical). This thesis looks
at the agreeing to disag...
-
The purpose of this thesis is to present a formal framework which
tries to present a novel modal logic for reasoning about
knowledge. Subsequently, we shall conform to the following structure:
§1 First, we shall elaborate the on our philosophical intuition
behind our epistemic logic, and prov...
-
This thesis presents a connectionist model of syntactic bootstrapping
processes in language acquisition. According to the Syntactic
Bootstrapping hypothesis, children acquiring language can learn (part
of) the meaning of new words based on the syntactic context in which
they appear. Psycholinguis...
-
In sequential logic there is an order in which the atomic propositions
in an expression are evaluated. This order allows the same atomic
proposition to have different values depending on which atomic
propositions have already been evaluated. In the sequential
propositional logic introduced by Berg...
-
The surprise examination paradox has been the topic of many
philosophical papers. However, despite its long history, no
long-lasting solution emerged. The debates related to the surprise
examination paradox go deeper than what the correct solution is. One
highly debated issue that I directly addr...
-
This thesis describes the connection between Agda, a modern dependently typed
functional language and GRIN, a modern functional back end language, and
compares the resulting system with the existing alternatives.
-
-
The field of algorithmic randomness is concerned with making precise
the intuitive notion of the randomness of individual objects, and is
grounded on concepts from computability theory. Not only do different
formalisations of irregularity, incompressibility and unpredictability
lead to the same cl...
-
Two-dimensional semantics is a theory in the philosophy of language
that provides an account of meaning which is sensitive to the
distinction between necessity and apriority. Usually, this theory is
presented in an informal manner. In this thesis, I take first steps
in formalizing it, and use th...