An Analysis of Some Relationships Between Post and Boolean Algebras
- 1 October 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 21 (4) , 680-696
- https://doi.org/10.1145/321850.321863
Abstract
The fundamentals of Post algebras are presented and Post and Boolean functions are examined. A functional representation is developed that facilitates the comparison of Post and Boolean algebras. Based on this representation, relationships between finite, higher-order (that is, more than 2-valued) Boolean algebras and functions in these algebras and finite, higher-order Post algebras and their corresponding functions are develop.Keywords
This publication has 5 references indexed in Scilit:
- A Many-Valued Algebra for Switching SystemsIEEE Transactions on Computers, 1970
- Aximos and some properties of Post algebrasColloquium Mathematicum, 1963
- The lattice theory of Post algebrasTransactions of the American Mathematical Society, 1960
- Post Algebras. I. Postulates and General TheoryAmerican Journal of Mathematics, 1942
- Introduction to a General Theory of Elementary PropositionsAmerican Journal of Mathematics, 1921