Maximal clones on uncountable sets that include all permutations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We first determine the maximal clones on a set X of infinite regular cardinality which contain all permutations but not all unary functions, extending a result of Heindorf's for countably infinite X. If |X| is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We then generalize a result of Gavrilov's to obtain on all infinite X a list of all maximal submonoids of the monoid of unary functions which contain the permutations.
19 pages; latest version has shorter proofs and no mistakes

Keywords

Rings and Algebras, Logic, 08A40; 08A05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/69817

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0401103
 http://arxiv.org/abs/math/0401103

Collections

arXiv