JUCS - Journal of Universal Computer Science 6(1): 5-21, doi: 10.3217/jucs-006-01-0005
Weak Inclusion Systems: Part Two
expand article infoVirgil Emil Cazanescu‡, Grigore Rosu§
‡ 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

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

© Virgil Cazanescu, Grigore Rosu.
This article is freely available under the J.UCS Open Content License.
Citation: Cazanescu VE, Rosu G (2000) Weak Inclusion Systems: Part Two. JUCS - Journal of Universal Computer Science 6(1): 5-21. https://doi.org/10.3217/jucs-006-01-0005
Open Access
Abstract
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.
Keywords
category theory, logic