There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lamb...
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
An event space is a set of instantaneous events that vary both in time and specificity. The concept of an event space provides a foundation for a logical--i.e., modular and open-a...