Results 1  10
of
24
The Origin of Relation Algebras in the Development and Axiomatization of the Calculus of Relations
, 1991
"... ..."
On Methods for Proving Lower Bounds in Propositional Logic
"... This paper is based on my lecture [26]. It examines the problem of proving nontrivial lower bounds for the length of proofs in propositional logic from the perspective of methods available rather than surveying known partial results (i.e., lower bounds for weaker proof systems). We discuss neither ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
This paper is based on my lecture [26]. It examines the problem of proving nontrivial lower bounds for the length of proofs in propositional logic from the perspective of methods available rather than surveying known partial results (i.e., lower bounds for weaker proof systems). We discuss neither motivations for proving lower bounds for propositional logic nor relations to other problems in logic or complexity theory. The reader is referred to [20] for the background information (as well as for all details missing in this paper). The paper is aimed at curious nonspecialists. The style of our exposition is accordingly informal at places and we do not burden the text (especially in the introduction) with exhausting references not directly related to our main objective. The reader starving for details can find them, together with all original references, in [20] (see also expository articles [25, 32]). Introduction
SNMP Query Language
, 1990
"... This report supersedes NYSERNet Technical Report 891229Abstract ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This report supersedes NYSERNet Technical Report 891229Abstract
Algebraic Terminological Representation
, 1991
"... This thesis investigates terminological representation languages, as used in klonetype knowledge representation systems, from an algebraic point of view. Terminological representation languages are based on two primitive syntactic types, called concepts and roles, which are usually interpreted mo ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This thesis investigates terminological representation languages, as used in klonetype knowledge representation systems, from an algebraic point of view. Terminological representation languages are based on two primitive syntactic types, called concepts and roles, which are usually interpreted modeltheoretically as sets and relations, respectively. I propose an algebraic rather than a modeltheoretic approach. I show that terminological representations can be naturally accommodated in equational algebras of sets interacting with relations, and I use equational logic as a vehicle for reasoning about concepts interacting with roles.
www based Boolean function minimization
 International Journal of Applied Mathematics and Computer Science
, 2003
"... In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the QuineMcCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up t ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the QuineMcCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL
The Laws of Boole's Thought
, 2000
"... The algebra of logic developed by Boole was not Boolean algebra. In this article we give a natural framework that allows one to easily reconstruct his algebra and see the di#culties it created for his successors. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The algebra of logic developed by Boole was not Boolean algebra. In this article we give a natural framework that allows one to easily reconstruct his algebra and see the di#culties it created for his successors.
Lattice laws forcing distributivity under unique complementation: Web support. http://www.mcs.anl.gov/~mccune/papers/uclattice
, 2005
"... Abstract. We give several new lattice identities valid in nonmodular lattices such that a uniquely complemented lattice satisfying any of these identities is necessarily Boolean. Since some of these identities are consequences of modularity as well, these results generalize the classical result of B ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We give several new lattice identities valid in nonmodular lattices such that a uniquely complemented lattice satisfying any of these identities is necessarily Boolean. Since some of these identities are consequences of modularity as well, these results generalize the classical result of Birkhoff and von Neumann that every uniquely complemented modular lattice is Boolean. In particular, every uniquely complemented lattice in M ∨ V(N5), the least nonmodular variety, is Boolean. 1.
Applications of Boolean Algebra: Claude Shannon and Circuit Design
, 2009
"... On virtually the same day in 1847, two major new works on logic were published by prominent ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
On virtually the same day in 1847, two major new works on logic were published by prominent
Discovering Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors
 International Journal of General Systems
, 2003
"... Boundary algebra is a new and simple notation for the Boolean algebra 2 and the truth functors. The primary arithmetic [PA] is built up from the atoms, ‘() ’ and the blank page, by enclosure between ‘( ‘ and ‘)’, denoting the primitive notion of distinction, and concatenation. Inserting letters deno ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Boundary algebra is a new and simple notation for the Boolean algebra 2 and the truth functors. The primary arithmetic [PA] is built up from the atoms, ‘() ’ and the blank page, by enclosure between ‘( ‘ and ‘)’, denoting the primitive notion of distinction, and concatenation. Inserting letters denoting the presence or absence of () into a PA formula yields boundary algebra [BA], a simpler notation for SpencerBrown’s (1969) primary algebra [pa]. The BA axioms are “()()=()”, and “(()) [=⊥] may be written or erased at will.” Repeated application of these axioms to a PA formula yields a member of B={(),⊥}, its simplification. If (a)b [dually (a(b))] ⇔ a≤b, then ⊥≤() [()≤⊥] follows trivially, so that B is a poset. BA is a selfdual notation for the Boolean algebra 2: (a) ⇔ a′, () ⇔ 1 [0] so that B is the carrier for 2, and ab ⇔ a∪b [a∩b]. The basis abc=bca (Dilworth 1938), a(ab) = a(b) (Bricken 2002), and a(a)=() facilitates clausal reasoning and proof by calculation. BA also simplifies the usual normal forms and Quine’s (1982) truth value analysis. () ⇔ true [false] yields boundary logic.
review: Frank Markham Brown’s Boolean Reasoning: The Logic of Boolean Equations
, 2005
"... introduction ..."