Record Details
Circuit algebras and some of their properties
ScholarsArchive at Oregon State University
| Field | Value |
|---|---|
| Title | Circuit algebras and some of their properties |
| Names |
Driessel, Kenneth Richard
(creator) Goheen, Harry (advisor) |
| Date Issued | 1965-05-15 (iso8601) |
| Note | Graduation date: 1965 |
| Abstract | It is well known that two-terminal switching circuits may be represented by boolean formulas. Thus the study of certain switching circuit problems leads to the study of free boolean algebras, in particular to the free boolean algebra on a countably infinite set of generators. An abstract characterization of this algebra is given in this paper. Switching circuits in general may be represented by matrices of boolean formulas. The corresponding algebra, called a "circuit algebra", is herein defined. Thus the study of more general switching circuit problems leads to the study of circuit algebras. One such algebra which appears to be closely related to general switching circuit problems is abstractly characterized in this paper. Some of the properties of circuit algebras are investigated preliminary to this characterization. |
| Genre | Thesis/Dissertation |
| Topic | Algebra, Boolean |
| Identifier | http://hdl.handle.net/1957/48145 |
