Weak inclusion systems

Authors:
Virgil Emil Cǎzǎnescu;Grigore Roşu
Affiliations:
University of Bucharest, Faculty of Mathematics, Department of Computer Science, Str. Academiei 14, R70109, Romania;University of Bucharest, Faculty of Mathematics, Department of Computer Science, Str. Academiei 14, R70109, Romania
Venue:
Mathematical Structures in Computer Science
Year:
1997

Citing 2
Cited 5

Logical support for modularisation

Papers presented at the second annual Workshop on Logical environments
Free Constructions in Algebraic Institutions

Proceedings of the Mathematical Foundations of Computer Science 1984

Logical foundations of cafeOBJ

Theoretical Computer Science - Rewriting logic and its applications
Axiomatizability in inclusive equational logics

Mathematical Structures in Computer Science
Behavioral extensions of institutions

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
An axiomatic approach to structuring specifications

Theoretical Computer Science
Parameterisation for abstract structured specifications

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define weak inclusion systems as a natural extension of inclusion systems. We prove that several properties of factorisation systems and inclusion systems remain valid under this extension and we obtain new properties as algebraic tools in abstract model theory.