Abstract
In this paper we give a syntactical answer to the following question: What do we actually know about a partial algebra when we know its set of weak or relative subalgebras with cardinal smaller than a fixed bound, if we do not have any information on how they are linked to each other within the algebra?
This work has been partially supported by the KBN grant 8-T11C-01011, and the DGCIyT grant PB96-0191-C02-02
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. Bartol, X. Caicedo, F. Rosselló, “Local equivalence of partial algebras.” Preprint (1997).
P. Burmeister, A Model Theoretic Oriented Approach to Partial Algebras. Mathematical Research vol. 32, Akademie-Verlag (1986).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bartol, W., Caicedo, X., Rosselló, F. (1998). Syntactical Content of Finite Approximations of Partial Algebras. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_56
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive