The purpose of this paper is to give an exposition of material dealing with constructive
logics, typed λ-calculi, and linear logic. The emergence in the past ten years of a coherent …

Gentzen's sequent calculus LJ, and its variants such as G3 [21], are (as is well known)
convenient as a basis for automating proof search for IPC (intuitionistic propositional …

This book is intended as a course in modal logic for students who have had prior contact
with modal logic and wish to study it more deeply. It presupposes training in mathematics or …

In computer science, ontologies are dynamic entities: to adapt them to new and evolving
applications, it is necessary to frequently perform modifications such as the extension with …

We show that the variety of Heyting algebras has finitary unification type. We also show that
the subvariety obtained by adding it De Morgan law is the biggest variety of Heyting …

What is nowadays the central part of any introduction to logic, and indeed to some the
logical theory par excellence, used to be a modest fragment of the more ambitious language …

Modularity in ontologies is key both for large scale ontology development and for distributed
ontology reuse on the Web. However, the problems of formally characterizing a modular …

This is an introduction to proof theory of nonclassical logic, which is directed at people who
have just started the study of nonclassical logics, using proof-theoretic methods. In our …

We develop a formal framework for comparing different versions of ontologies, and apply it
to ontologies formulated in terms of DL-Lite, a family of 'lightweight'description logics …

We consider the problem of computing the logical difference between distinct versions of
description logic terminologies. For the lightweight description logic EL, we present a …