This paper discusses the relation between the minimal positive relevant logic B+ and intersection and union type theories. There is a marvellous coincidence between these very diff...
Mariangiola Dezani-Ciancaglini, Robert K. Meyer, Y...
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
The theory of Schauder hats is a beautiful and powerful tool for investigating, under several respects, the algebraic semantics of Lukasiewicz infinite-valued logic [CDM99], [MMM07...
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...