109 urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891 JUCS - Journal of Universal Computer Science jucs 0948-695X 0948-6968 Journal of Universal Computer Science 10.3217/jucs-006-01-0005 27628 Research Article F.4.1 - Mathematical Logic Weak Inclusion Systems: Part Two Cazanescu Virgil Emil vec@funinf.math.unibuc.ro 1 Rosu Grigore 2 Fundamentals of Computer Science, Faculty of Mathematics, University of Bucharest, Bucharest, Romania Fundamentals of Computer Science, Faculty of Mathematics, University of Bucharest Bucharest Romania Department of Computer Science & Engineering, University of California, San Diego, United States of America Department of Computer Science & Engineering, University of California San Diego United States of America

Corresponding author: Virgil Emil Cazanescu (vec@funinf.math.unibuc.ro).

Academic editor:

2000 28 01 2000 6 1 5 21 62172D16-B427-570D-93EE-875FD7F1228B 6995760 Virgil Emil Cazanescu, Grigore Rosu This article is freely available under the J.UCS Open Content License.

New properties and implications of inclusion systems are investigated in the present paper. Many properties of lattices, factorization systems and special practical cases can be abstracted and adapted to our framework, making the various versions of inclusion systems useful tools for computer scientists and mathematicians. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift.