An interpretation of the propositional Boolean algebra as a k-algebra. effective calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 958, Issue , 1995, Pages 255-263

  Laita, Luis M ^a   de Ledesma, Luis ^a   Roanes Lozano, Eugenio ^b   Roanes Macías, Eugenio ^b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CALCULATIONS;

COMMUTATIVE ALGEBRA; COMPUTER ALGEBRA; COMPUTER ALGEBRA SYSTEMS; K-ALGEBRAS; KNOWLEDGE BASIS; LOWER COMPLEXITY;

BOOLEAN ALGEBRA;

EID: 84957073534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60156-2_18     Document Type: Conference Paper

References (6)

1. [Ha] Halmos, P.R. Lectures on Boolean Algebras. Springer-Verlag (1974)
2. [He] Hearn, A.C.: REDUCE User's Manual v.3.3. Rand Pub. (1987)
3. [Hr] Hermes, H.: La teoría de retículos y su aplicación a la lógica mateática. Conf. Mat. VI, CSIC-Madrid (1963)
4. [Ch] Char, B.W. et al.: Maple V. Library Reference Manual. Springer-Verlag (1991) [Mo] Monk, D.: Handbook of Boolean Algebras. North-Holland (1989)
5. [MW] McCallum, M., Wright, F.: Algebraic Computing with REDUCE. Oxford Univ. Press (1991)
6. [Ra] Rayna, G.: REDUCE. Software for Algebraic Computation. Springer-Verlag (1987)