This comprehensive book provides an adequate framework to establish various calculi of
logical inference. Being an? enriched? system of natural deduction, it helps to formulate …

In proof theory the notion of canonical proof is rather basic, and it is usually taken for granted
that a canonical proof of a sentence must be unique up to certain minor syntactical details …

The conception of the very first decision procedures for first-order sentences brought about
the need for giving citizenship to function symbols (eg Skolem functions). We argue that a …

The notion of normal proof theory, and yet it has been somewhat neglected by the systems
of equational logic. The intention here is then to show the normalization procedure for the …

As a celebration of the Tractatus 100th anniversary it might be worth revisiting its relation to
the later writings. From the former to the latter, David Pears recalls that “everyone is aware of …

Overview The functional interpretation of logical connectives is concerned with a certain
harmony between, on the one hand, a indexfunctional! calculus functional calculus on the …

The intention here is that of giving a formal underpinning to the idea of 'meaning-is-
use'which, even if based on proofs, it is rather different from proof-theoretic semantics as in …

Since the early days of Kripke-style possible-worlds semantics for modalities, there has
been a significant amount of research into the development of mechanisms for handling and …

The article discusses the connection between proof theory and computer programming
which can be found in the Intuitionistic Type Theory (ITT) of P. Martin-Löf. It states that the …

On the basis of a labelled deduction system (LND TRS), we demonstrate how to formalize
the concept of computational paths (sequences of rewrites) as equalities between two terms …