Syntactical content of finite approximations of partial algebras

DOI10.1007/3-540-69115-4_56MaRDI QIDQ4400873zbMATH OpenFDO

Authors Xavier Caicedo, Wiktor Bartol, Francesc Rosselló

Publication date 8 April 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-69115-4_56

zbMATH Keywords

indiscernibilitypartial algebrarelative subalgebrasstructural approximationweak subalgebras

Mathematics Subject Classification ID

Partial algebras (08A55)

Review text

The authors present some results concerning the knowledge about a partial algebra when information on the set of weak (or relative) subalgebras of restricted cardinality of the given partial algebra is given. For the entire collection see [Zbl 0891.00026].

Recommendations

• scientific article; zbMATH DE number 4006322
• Completeness theory for finite partial algebras
• Some characterizations of partial algebras
• scientific article; zbMATH DE number 3963900

This page was built for publication: Syntactical content of finite approximations of partial algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400873)