-
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 ...
-
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 ...
-
This dissertation investigates learnability of various classes of
classical categorial grammars within the Gold paradigm of identification
in the limit from positive data. Both learning from functor-argument
structures and learning from flat strings are considered.
The class of rigid grammar...
-
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...