Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
We present a complete axiomatization of a logic denoted by MTML (Mereo-Topological Modal Logic) based on the following set of mereotopological relations: part-of, overlap, underlap...