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 …

We present a way of formalizing the intensional identity type based on the notion of
computational paths which will be taken to be proofs of propositional equality, and thus …

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 …

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 …

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 …

We use a labelled deduction system based on the concept of computational paths
(sequences of rewrites) as equalities between two terms of the same type. We also define a …

The treatment of equality as a type in type theory gives rise to an interesting type-theoretic
structure known asidentity type'. The idea is that, given terms $ a, b $ of a type $ A $, one …

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 …

Further to the connections between meaning and use, it seems useful to consider the
(explanation of the immediate) consequences one is allowed to draw from a proposition as …