Although best known for his work in symbolic logic, George Boole made seminal contributions in the logic of probabilities. He solved the probabilistic inference problem with a projection method, leading to the insight that inference (as well as optimization) is essentially a projection problem. This unifying perspective has applications in constraint programming, because consistency maintenance...

The study of computer design and architecture includes many topics on formal languages and discrete structures. Among these are state minimizations, Boolean algebra, and switching algebra. In minimization, three approaches are normally used that are based on equivalence relations. Partial order relations are used today in constructions of Boolean algebra. In this paper we survey this important ...

This report addresses the work done on knowledge representation and automated reasoning before the invention of computers, including the work by Leibniz, Boole, and Jevons. We show how pre-computer work in formal logic, artificial languages, and automated reasoning devices contributed to the development of AI. Topics include scholastic logic; the art of memory; Lull’s inference mechanisms; Leib...

The modern phase in Logic begins in the middle of the 19th century with the work of Frege, Boole, de Morgan and Peirce. A second phase began in the early 20th century with Russell’s discovery of his paradox, followed by Hilbert’s program to try (unsuccessfully) to get around it. Finally, the thirties saw fundamental developments by Gödel, Turing, Post, Church and Tarski. By this time, the follo...

where (~xn) ∈ B and B is a Boolean algebra. Only finite Boolean algebras are considered. The Boolean logic presented is based on the abstract Boolean algebra given by Huntington’s [14] postulates and on a special canonical form for a Boolean function given by Archie Blake [2]. The theory of reasoning is divided into functional and general parts, both of which seek antecedents or consequents of ...

Quantum logic has been introduced by Birkhoff and von Neumann as an attempt to base the logical primitives, the propositions and the relations and operations among them, on quantum theoretical entities, and thus on the related empirical evidence of the quantum world. We give a brief outline of quantum logic, and some of its algebraic properties, such as nondistributivity, whereby emphasis is gi...

We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hitherto, via fitted operator methods, was one (see, e.g., [Doolan et al. Uniform numerical methods for problems with initial and boundary layers, Boole Press, Dublin, 1980], p. 121]). Reducing the original problem into th...

Quantum logic has been introduced by Birkhoff and von Neumann as an attempt to base the logical primitives, the propositions and the relations and operations among them, on quantum theoretical entities, and thus on the related empirical evidence of the quantum world. We give a brief outline of quantum logic, and some of its algebraic properties, such as nondistributivity, whereby emphasis is gi...

We study the asymptotic relation between the probability and the complexity of Boolean functions in the implicational fragment which are generated by large random Boolean expressions involving variables and implication, as the number of variables tends to infinity. In contrast to models studied in the literature so far, we consider two expressions to be equal if they differ only in the order of...