-
This thesis aims to develop a position called logical functionalism, as an improvement on previous logical pluralist positions. The main idea of logical functionalism is to take logical consequence to be a functional concept. From a pre-theoretic notion of logical consequence, I distil the core f...
-
This thesis concerns Moore’s paradox and its relations to other paradoxes and problems. In particular, it concerns the relations between Moore’s paradox and the surprise exam paradox, the knowability paradox, the Toxin problem, Newcomb’s problem and multiple problems that are formulated for the f...
-
This thesis studies several aspects of the topological semantics for evidence-based belief and knowledge introduced by Baltag, Bezhanishvili, Özgün, and Smets (2016).
Building on this work, we introduce a notion of generic models, topological spaces whose logic is precisely the sound and complet...
-
Much of what we say aims to spark the imagination rather than inform. Imperatives to imagine such as “Imagine you are eating coconut ice cream” as well as counterfactual antecedents such as “If we hadn’t met at the gelato bar...” serve to raise hypothetical contexts. This essay is about the logic...
-
In this thesis, we develop a Gödel-style translation of a positive calculus, that is, a calculus that is equivalent to the positive fragment of classical propositional logic that is sound and complete with respect to bounded distributive lattices, into a suitable expansion of classical logic. In ...
-
This thesis explores how a well-founded and uniform compositional account can be given of coordinated questions. First, the empirical picture of question coordination is explored by making a direct comparison between conjunctive, disjunctive, and polar questions. Some surprising observations are ...
-
Leitgeb proposes an acceptance rule based on the notion of probabilistically stable hypotheses. This stability rule offers a formal solution to the Lottery Paradox and suggests a promising account of the relationship between logical and probabilistic models of belief. In this thesis, we investiga...
-
In this thesis we explore closure ordinals of the modal μ-calculus. The closure ordinal of a μ-calculus formula φ(x) is the least ordinal α, if it exists, such that the iteration of the meaning function φ^S_x starting from the emptyset converges to its least fixed point in at most α many steps on...
-
We use recurrent neural networks (RNNs) for deciding locally k-testable languages. We show that, when used for deciding languages, RNNs fail to generalise to unseen examples. However, using attention greatly improves the generalisation. We then implement a differentiable version of the scanner us...
-
In this thesis we investigate to what extent the Kan-Quillen model structure on simplicial sets can be transferred along the left adjoint of the free-forgetful adjunction with semisimplicial sets. We establish the novel result that, while the full model structure cannot be transferred, the underl...
-
Personality inconsistency is one of the major problems for chit-chat sequence to sequence conversational agents. Works studying this problem have proposed models with the capability of generating personalized responses, but there is not an existing evaluation method for measuring the performance ...