Abstract
A basic problem in the general theory of algebras is the determination of the number of nonisomorphic algebras with a given (finitary) similarity type and infinite power. Our main result is to show that in every case the number of such algebras actually equals the most naturally computed upper bound. In particular we show that if r is any similarity type containing n symbols, at least one of which is positive rank, and m is any infinite cardinal then there exist exactly 2m nonisomorphic algebras with similarity type r and power m. The corresponding problem for finite algebras was considered in Harrison [1]. In ?0 we introduce definitions and accompanying notation; in ?1 we consider the special problem of determining the number of nonisomorphic unary algebras (our work is based on the construction presented before Lemma 1); and in ?2 we consider this determination problem for arbitrary algebraic similarity types.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
