Weak Inclusion Systems: Part Two

dc.creatorCazanescu,Virgil
dc.creatorRosu,Grigore
dc.date2000
dc.date.accessioned2024-02-06T12:50:28Z
dc.date.available2024-02-06T12:50:28Z
dc.descriptionNew 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-006-01-0005
dc.identifierhttps://lib.jucs.org/article/27628/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7696
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 6(1): 5-21
dc.subjectcategory theory
dc.subjectlogic
dc.titleWeak Inclusion Systems: Part Two
dc.typeResearch Article
Файлы