Abstract
A set of operations on A is shown to be the set of linear term operations of some algebra on A if and only if it is closed under permutation of variables, addition of inessential variables, and composition, and if it contains all projections. A Galois framework is introduced to describe the sets of operations that are closed under the operations mentioned above, not necessarily containing all projections. The dual objects of this Galois connection are systems of pointed multisets, and the Galois closed sets of dual objects are described accordingly. Moreover, the closure systems associated with this Galois connection are shown to be uncountable (even if the closed sets of operations are assumed to contain all projections).
Similar content being viewed by others
References
Bodnarčuk, V.G., Kalužnin, L.A., Kotov, V.N., Romov, B.A.: Galois theory for Post algebras, I, II. Kibernetika 3, 1–10, 5, 1–9 (1969) (Russian). English translation: Cybernetics 5, 243–252, 531–539 (1969)
Couceiro M., Foldes S.: On closed sets of relational constraints and classes of functions closed under variable substitution. Algebra Universalis 54, 149–165 (2005)
Couceiro, M., Lehtonen, E.: Classes of operations closed under permutation, cylindrification and composition. In: 40th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2010), pp. 117–121. IEEE Computer Society, Los Alamitos (2010)
Crama Y., Hammer P.L.: Boolean Functions – Theory, Algorithms, and Applications. Cambridge University Press, Cambridge (2011)
Denecke, K., Erné, M., Wismath, S.L. (eds.): Galois Connections and Applications. Kluwer, Dordrecht (2004)
Denecke, K., Wismath, S.L.: Universal Algebra and Applications in Theoretical Computer Science. Chapman & Hall/CRC, Boca Raton (2002)
Everett C.J.: Closure operations and Galois theory in lattices. Trans. Amer. Math. Soc. 55, 514–525 (1944)
Geiger D.: Closed systems of functions and predicates. Pacific J. Math. 27, 95–100 (1968)
Harnau, W.: Ein verallgemeinerter Relationenbegriff für die Algebra der mehrwertigen Logik, Teil I (Grundlagen), Teil II (Relationenpaare), Teil III (Beweis). Rostock. Math. Kolloq. 28, 5–17 (1985), 31, 11–20 (1987), 32, 15–24 (1987)
Hellerstein L.: On generalized constraints and certificates. Discrete Math. 226, 211–232 (2001)
Lau D.: Function Algebras on Finite Sets. Springer, Berlin (2006)
Lehtonen E.: Closed classes of functions, generalized constraints and clusters. Algebra Universalis 63, 203–234 (2010)
Mal’cev, A.I.: Iterative Post Algebras. Nauka, Novosibirsk (1976) (Russian)
Ore Ø.: Galois connexions. Trans. Amer. Math. Soc. 55, 493–513 (1944)
Pippenger N.: Galois theory for minors of finite functions. Discrete Math. 254, 405–419 (2002)
Pöschel, R.: Concrete representation of algebraic structures and a general Galois theory. In: Kautschitsch, H., Müller, W.B., Nöbauer, W. (eds.) Contributions to General Algebra (Klagenfurt, 1978), pp. 249–272. Johannes Heyn, Klagenfurt (1979)
Pöschel, R.: A general Galois theory for operations and relations and concrete characterization of related algebraic structures. Report R-01/80, Zentralinstitut für Mathematik und Mechanik, Akademie der Wissenschaften der DDR, Berlin (1980)
Pöschel, R., Kalužnin, L.A.: Funktionen- und Relationenalgebren: Ein Kapitel der diskreten Mathematik. Birkhäuser, Basel (1979)
Szabö, L.: Concrete representation of related structures of universal algebras, I. Acta Sci. Math. (Szeged) 40, 175–184 (1978)
Szendrei, Á.: Clones in Universal Algebra. Séminaire de mathématiques supérieures, vol. 99. Les Presses de l’Université de Montréal, Montréal (1986)
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by R. Poeschel.
Rights and permissions
About this article
Cite this article
Couceiro, M., Lehtonen, E. Galois theory for sets of operations closed under permutation, cylindrification, and composition. Algebra Univers. 67, 273–297 (2012). https://doi.org/10.1007/s00012-012-0184-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00012-012-0184-1