-
This thesis belongs to the field of process theories and process algebras.
In the first part the model of Rem and Kaldewaij for
communicating processes is analyzed, which shows that their definitions in fact
describe two different models, the first based on prefix-closed trace
structures, the s...
-
This thesis presents a mathematical logical analysis of the
infrastructure of partial worlds, and demonstrates how its
model-theoretical treatment can be used for a constructive
formalization of the dynamics of a group of reasoning and
communicating agents.
Following G\"ardenfors' influential g...
-
This thesis is about mathematical descriptions of computer languages. This raises the question of what computer languages are, and why they should be described mathematically.
A computer language gives people the ability to communicate with an automated system. To name three examples: The progra...
-
This thesis consists of two parts. The first part is concerned with
bounded arithmetic. The first chapter introduces and motivates the
research in this dissertation. Extensions of weak fragments of Peano
arithmetic to second-order theories are studied. Second-order
variables represent finite set...
-
The topic of this dissertation is diagonalizable algebra's, in
particular those of formal theories such as Peano arithmetic.
Part one discusses algebras that can be embedded in a diagonalizable
algebra of a given formal theory. In the case of embeddings with a
recursively enumerable range, the ...
-
Process algebra, or process theory, constitutes an attempt to reason about
`behaviours of systems' in a mathematical framework. Starting from a syntax,
each syntactic object is supplied with some kind of behaviour, and a semantic
equivalence says which behaviours are to be identified. (Bisimula...
-
Bounded Rationality has two interpretations: a wide one and a narrow one.
In the wide interpretation, {\em bounded rationality} refers to the phenomenon
agents have limited cognitive resources and capabilities. In the narrow
interpretation, bounded rationality refers to the notion raised by H....
-
We investigate several weakened versions of first--order logic, and of
the logic of binary relations, as provided by representable relation
algebras. The most important reason to weaken these two well-known and
often-used logics is their complexity: the theory of both systems is
undecidable. Thes...
-
In the way natural languages have a semantics, pictures also have
semantics when they are used as a medium to help people to
communicate. However, there is a distinction between picture semantics
and natural language semantics: the semantics of pictures is not fixed
by convention. The same pictur...
-
In recent years, there has been a growing interest in tools that
facilitate the understanding, analysis, and debugging of programs.
This thesis is concerned with tools and techniques that support the
analysis of programs. Instead of directly implementing program
analysis tools, our aim is to gene...
-
The dissertation is structured as follows. Chapter 1 provides a brief introduction to the field of logic programming and program transformations.
In Chapter 2, the semantics of normal logic programs are discussed. This chapter serves as an introduction to the subsequent three chapters. Additiona...