Complete orders, categories and lattices of approximations

Fundamenta Informaticae

Volumn 72, Issue 1-3 SPEC. ISS., 2006, Pages 421-435

  Wolski, Marcin ^a  

^a MARIA CURIE SK ODOWSKA UNIVERSITY   (Poland)

Author keywords

* autonomous category; Approximation; Bilattice; Chu construction; Complete partial order; Nelson lattice; Rough set

Indexed keywords

APPROXIMATION THEORY; BOOLEAN ALGEBRA; KNOWLEDGE BASED SYSTEMS; NUMERICAL METHODS; OPTIMIZATION; SET THEORY;

; -AUTONOMOUS CATEGORY; AUTONOMOUS CATEGORY; BILATTICE; CHU CONSTRUCTION; COMPLETE PARTIAL ORDER; NELSON LATTICE; ROUGH SETS;

PROBLEM SOLVING;

EID: 33747042759     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (19)

1. Abramsky, S., Jung, A., Domain Theory. In Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.), Handbook of Logic in Computer Science, vol. III, Oxford University Press, 1994.
2. Avron, A., A note on the structures of bilattices, Journal of Mathematical Structures in Computer Science, 5, 431-438, 1995.
3. Barr, M., *-Autonomous Categories, Lecture Notes in Mathematics, vol. 752, Springer-Verlag, 1979.
4. Barr, M., *-autonomous categories and linear logic, Mathematical Structures in Computer Science, 1, 159-178, 1991.
5. Blute, R., Scott, Ph., Category theory for linear logicians. In Ehrhard, Th., Jirard, J., Ruet, P., Scott, Ph. (eds.), Linear Logic in Computer Science, Cambridge University Press, 3-64, 2005.
6. Fitting, M. C., Bilattices in logic programming. In Epstein, G. (ed.) The Twentieth International Symposium on Multiple-Valued Logic, IEEE, 238-246, 1990.
7. Ginsberg, M. L., Multivalued logics: a uniform approach to reasoning in artificial intelligence, Computational Intelligence, 4, 256-316, 1988
8. Marek, V., Truszczyński, M., Contributions to the theory of rough sets, Fundamenta Informaticae, 39 (4), 389-409, 1999.
9. Nelson, D., Constructible falsity, Journal of Symbolic Logic, 14, 16-26, 1949.1999.
10. Pagliani, P., Some remarks on special lattices and related constructive logics with strong negation, Notre Dame Journal of Formal Logic, 31 (4), 515-528, 1990.
11. Pagliani, P., Rough set theory and logic-algebraic structures. In Orlowska, E. (ed.), Incomplete Information: Rough Set Analysis, Studies in Fuzziness and Soft Computing, vol. 13, Physica Verlag, Heidelberg, 109-192, 1998.
12. Patterson, A., A symmetric model theory for constructible falsity, Bulletin of the Association of Symbolic Logic. Summer Meeting of the ASL, 1996; available at http://wwwformal.stanford.edu/annap/www/abstracts.html
13. Patterson, A., Implicit programming and the Logic of Constructible Duality, PhD Thesis, 1998; available at http://www-formal.stanford.edu/annap/ www/abstracts.html
14. Pawlak, Z., Rough sets, Int. J. Computer and Information Sci., 11, 341-356, 1982.
15. Polkowski, L., Rough Sets: Mathematical Foundations, Advances in Soft Computing, Physica-Verlag, 2002.
16. Rasiowa, H., N-lattices and constructive logic with strong negation, Fundamenta Mathematicae, 46, 61-80, 1958.
17. Rasiowa, H., Algebraic models of logics, University of Warsaw, 2001.
18. Vakarelov, D., Notes on N-lattices and constructive logic with strong negation, Studia Logica 36, 109-125, 1977.
19. Vakarelov, D., Nelson's negation on the base of weaker versions of intuitionistic negation, Studia Logica, 80, 393-430, 2005.