We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
We study the following problem: Given a transition system T and its quotient T/∼ under an equivalence ∼, which are the sets L, L′ of Hennessy-Milner formulae such that: if Ï...
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
The aim of the present paper is to provide a metalogical systematisation in the area of deontic action logic based on Boolean algebra. Differences among the systems in question lie...
We develop a query algebra that supports efficient assertion retrieval--a natural extension of instance retrieval. The algebra is based on previously developed techniques for index...
Jeffrey Pound, David Toman, Grant E. Weddell, Jiew...