Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
The idea of Conceptual Neighbourhood Diagram (CND) has proved its relevance in the areas of qualitative reasoning about time and qualitative reasoning about space. In this work, a ...
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...