Multilattices via multisemilattices

Topics in Applied and Theoretical Mathematics and Computer Science

Volumn , Issue , 2001, Pages 238-248

  Martinez J ^a   Gutierrez G ^a   De Guzman I P ^a   Cordero, P ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Multilattice; Multisemilattice; Non deterministic operators; Poset; Universal Algebra

Indexed keywords

ASSOCIATIVE PROCESSING; AUTOMATION; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; MATRIX ALGEBRA;

MULTILATTICE; MULTISEMILATTICE; NON-DETERMINISTIC OPERATORS; POSET; UNIVERSAL ALGEBRA;

SET THEORY;

EID: 4944232589     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Article

References (10)

1. Mihail Benado. Les ensembles partiellement ordonnés et le théorème de raffinement de Schreier. I. Čehoslovack. Mat. Ž., 4(79):105-129, 1954.
2. Alfredo Burrieza and Inrnaculada P.de Guzmán. A new algebraic semantic approach and adequate connectives for computation with temporal logic over discrete time. Journal of Applied Non-Classical Logics, 2(2):181-200, 1991.
3. Pablo Cordero, Manuel Enciso, and Inmaculada P.de Guzmán. Structure theorems for closed sets of implicates/implicanta in temporal logic. Lecture Notts in Artificial Intelligence, 1695.
4. Pablo Cordero, Manuel Enciso, and Inmaculada P.de Guzmán. From the posets of temporal implicates/implicants to a temporal negative normal form. Reports on Mathematical Logics, 36:3-48, 2002.
5. Gloria Gutiérrez, Javier Martínez, Manuel Ojeda, Agustín Valverde, and Inmaculada P.de Guzmán. Reduction theorems for boolean formulas using δ-trees. Lecture Notes in Computer Science, 2000.
6. R. Hahnle. Advances in Many-Valued Logics. Handbook of Philosophical Logic. Kluwer, 1999.
7. R. Hahnle and G. Escalada. Deduction in many valued logics: a survey. Mathware and Soft Computing, 1997.
8. D. J. Hansen. An axiomatic characterization of multilattices. Discrete Math., 33(1):99-101, 1981.
9. Hans Kamp. Tense logic and theory of linear orders. PhD thesis, University of California, Los Angeles, 1968.
10. Manuel Ojeda, Gabriel Aguilera, Agustín Valverde, and Inmaculada P.de Guzmán. Reductions for non-clausal theorem proving. Theoretical Computer Science, To appear.