-
-
This thesis describes the PSF Toolkit, a set of software tools for specifying concurrent processes based on the specification language PSF (Process Specification Formalism). It is divided into three main parts: languages, tools and case studies.
The first part of this thesis describes the lang...
-
-
-
Taming amounts to finding computationally well-behaved versions of logics
and classes of algebras. The main concern of the dissertation is to find
decidable and complete versions of arrow logic and predicate logic. These
results are achieved by proving the equivalent decidability and finite
axiom...
-
Meta-Logics for Logic Programming
Marianne Kalsbeek
This dissertation consists of three separate parts, each of which can be read independently. In each part, a theme in Logic Programming (or rather, the practice of Logic Programming) is taken up and investigated from a logical point of view.
Pa...
-
-
In this dissertation we apply complexity theory to various grammatical
formalisms. We presuppose that the reader has basic knowledge of the formal
aspects of linguistics and the formal language theory. Familiarity with the
rudiments of complexity theory is required to fully understand the materia...
-
-
-
%Nr: DS-1995-19
%Author: Erik Aarts
%Title: Investigations in Logic, Language and Computation
In this dissertation the time complexity of three problems is considered.
The time complexity of a problem is the relation between the time a computer
needs to solve a problem and the size of that pro...