Finitely presentable objects in ${\rm(}Cb\text{-}{\bf Sets}{\rm)}_{_{\rm fs}}$

Document Type : Research Paper

Authors

1 Department of Mathematics, Faculty of Mathematics, Statistics and Computer Sciences, Semnan University, Semnan, Iran.

2 Department of Mathematics, Velayat University, Iranshahr, Sistan and Balochistan, Iran.

3 Faculty of Mathematics, Statistics and Computer Sciences, Department of Mathematics, Semnan University, Semnan, Iran.

10.48308/cgasa.2024.235466.1487

Abstract

Pitts generalized nominal sets to finitely supported $Cb$-sets by utilizing the monoid $Cb$ of name substitutions instead of the monoid of finitary permutations over names. Finitely supported $Cb$-sets provide a framework for studying essential ideas of models of homotopy type theory at the level of convenient abstract categories.   
Here, the interplay of two separate categories of finitely supported actions of a submonoid of ${\rm End}(\mathbb {D})$, for some countably infinite set $\mathbb {D}$, over sets is first investigated. In particular, we specify the structure of free objects.
Then, in the category of finitely supported $Cb$-sets, we characterize the finitely presentable objects and provide a generator in this category.

Keywords

Main Subjects


[1] Ad´amek, J., Milius, S., Sousa, L., and Wißmann, T., Finitely Presentable Algebras for Finitary Monads, Theory Appl. Categ. 34(37) (2019), 1179-1195.
[2] Ad´amek, J. and Rosick´y, J., “Locally presentable and accessible categories”, Cambridge University Press, 1994.
[3] Ad´amek, J., Rosick´y, J., and Vitale, E.M., “Algebraic Theories: A Categorical Introduction to General Algebra”, Cambridge University Press, 2010.
[4] Burris, S. and Sankappanavar, H.P., “A Course in Universal Algebra”, New York: Springer-Verlag, 1981.
[5] Ebrahimi, M.M., Keshvardoost, Kh., and Mahmoudi, M., Simple and subdirectly irreducible finitely supported Cb-sets, Theort. Comput. Sci. 706 (2018), 1-21.
[6] Ebrahimi, M.M. and Mahmoudi, M., The category of M-sets, Ital. J. Pure Appl. Math. 9 (2001), 123-132.
[7] Gabbay, M.J. and Hofmann, M., Nominal renaming sets, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (2008), 158–173.
[8] Gabbay, M.J. and Pitts, A., A new approach to abstract syntax with variable binding, Form. Asp. Comput. 13 (2002), 341-363.
[9] Hosseinabadi, A., Haddadi, M., and Keshvardoost, Kh., On nominal sets with support-preorder, Categ. Gen. Algebaic Struct. Appl. 17(1) (2022), 141-172.
[10] Kilp, M., Knauer, U., and Mikhalev, A., “Monoids, Acts and Categories”, Walter de Gruyter, 2000.
[11] Pasbani, H. and Haddadi, M., The fresh-graph of a nominal set, Discrete Math. Algorithms Appl. 15(7) (2023), 2250161 (17 pages).
[12] Petrisan, D., Investigations into Algebra and Topology over Nominal Sets, Ph.D. Thesis, University of Leicester (2011).
[13] Pitts, A., “Nominal sets, Names and Symmetry in Computer Science”, Cambridge University Press, 2013.
[14] Pitts, A, Nominal presentations of the cubical sets model of type theory, LIPIcs. Leibniz Int. Proc. Inform. (2015), 202-220.
[15] Razmara, N.S., Haddadi, M., and Keshvardoost, Kh., Fuzzy nominal sets, Soft Comput. to appear, https://doi.org/10.1007/s00500-024-09709-9.