-
We consider two recently proposed definitions of the expressive power of
description logics, one due to Baader, the other due to Kurtonina and de
Rijke. The proposals are nonequivalent, and we explain their differences,
similarities, as well as ways in which they are related. We also map out ...
-
We propose to bring together two research traditions, computation with first
order logic from computer science, and dynamic interpretation of first order
logic from natural language semantics. We define a new executable process
interpretation for first order logic, and show that it is a faithf...
-
In this paper, we study decision making in situations where the outcomes of
the options are (in general) uncertain, without making the assumption that
this uncertainty can be exactly quantified by means of a (single)
probability measure. In such situations of partial ignorance, the
traditional no...
-
This dissertation is concerned with a number of fundamental,
theoretical and empirical issues in the dynamic semantics of
natural language. In dynamic semantics, the meaning of a sentence
is not represented in isolation, but in terms of the ability to
change certain states.
Dekker gives a type-...
-
In this thesis Harry Buhrman studies reductions bounded in
polynomial time. Such a reduction induces an equivalence relation on sets
such that the equivalence classes, consisting of sets that mutually reduce,
can be ordened partially. Buhrman studies the structures that polynomial
reductions impo...
-
This thesis contains a number of results in the field of the
metamathematics of first order arithmetic. The focus is on the study
of provability of bounded arithmetic and an alternative definition
of interpretability.
First, Verbrugge introduces notions of efficiency, complexity theory,
bounded...
-
This thesis is concerned with extensions of the standard modal language.
After the introduction in chapter 1, chapter 2 develops a general perspective
on modal logic according to which modal languages are primarily many-sorted
descreption languages for relational structures, mainly concerned ...
-
In theories of formal grammar it has become customary to assume that
linguistic expressions belong to syntactic {\em categories}, whereas their
interpretations inhabit semantic {\em types}. {\em Studied Flexibility} is
an exploration of the consequences of this twofold assumption. Its starting...
-
This thesis is a compilation of several studies within the area of theoretical
computer science. Most deal with algorithms and their associated complexity
measures like time and space, but there is also the odd measure like the use
of energy in electronic circuits.
Chapter 2 is concerned wit...
-
Linear logic (Girard, 1987) is a refinement of the formulation of classical
logic as a sequent calculus (Gentzen, 1935). The `intervention' is simple:
in the `classical' formulation a formula, present as a hypothesis in a
derivation, can be used an unlimited number of times, and any formula...
-
The ASF+SDF Meta-environment is an interactive development environment
for writing specifications in ASF+SDF. This is an algebraic formalism
that is, among others, used to generate interactive programming
environments. An ASF+SDF specification consists of two parts: the
syntax, and the semantics ...