{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:11:11Z","timestamp":1760145071712,"version":"build-2065373602"},"reference-count":15,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:00:00Z","timestamp":1718755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In mathematics, philosophy, cosmology, and theology, the notion of infinity has generated ample debate. Much less discussion has been generated by the notion of finiteness. However, when we consider finitely supported sets, the notion of finiteness becomes more interesting and richer. We present several independent definitions of finite sets within the framework of finitely supported structures, emphasizing the differences between these definitions.<\/jats:p>","DOI":"10.3390\/sym16060770","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T05:27:19Z","timestamp":1718861239000},"page":"770","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finite Sets\u2014What Kind of Finite?"],"prefix":"10.3390","volume":"16","author":[{"given":"Andrei","family":"Alexandru","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Romanian Academy, 700505 Ia\u015fi, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8166-9456","authenticated-orcid":false,"given":"Gabriel","family":"Ciobanu","sequence":"additional","affiliation":[{"name":"Academia Europaea, London WC1E7HU, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,6,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Alexandru, A., and Ciobanu, G. (2016). Finitely Supported Mathematics: An Introduction, Springer.","DOI":"10.1007\/978-3-319-42282-4"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Alexandru, A., and Ciobanu, G. (2020). Foundations of Finitely Supported Structures: A Set Theoretical Viewpoint, Springer.","DOI":"10.1007\/978-3-030-52962-8"},{"key":"ref_3","first-page":"27","article-title":"Uber die Unabh\u00e4ngigkeit des Auswahl Axioms und Einiger seiner Folgerun","volume":"31","author":"Lindenbaum","year":"1938","journal-title":"Comptes Rendus Seances Soc. Sci. Lett. Vars."},{"key":"ref_4","unstructured":"Jech, T. (1973). The Axiom of Choice, Courier Corporation. Studies in Logic and the Foundations of Mathematics."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s001650200016","article-title":"A new approach to abstract syntax with variable binding","volume":"13","author":"Gabbay","year":"2001","journal-title":"Form. Asp. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Pitts, A. (2013). Nominal Sets Names and Symmetry in Computer Science, Cambridge University Press.","DOI":"10.1017\/CBO9781139084673"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Klin, B., and Lasota, S. (2011, January 21\u201324). Automata with group actions. Proceedings of the 26th Symposium on Logic in Computer Science, Toronto, ON, Canada.","DOI":"10.1109\/LICS.2011.48"},{"key":"ref_8","unstructured":"Hofman, P., Juzepczuk, M., and Pattathurajan, S.L.M. (July, January 29). Parikh\u2019s theorem for infinite alphabets. Proceedings of the 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, Virtual."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.tcs.2022.09.002","article-title":"Fast computations on ordered nominal sets","volume":"935","author":"Venhoek","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s00153-021-00787-2","article-title":"Various forms of infinity for finitely supported structures","volume":"61","author":"Alexandru","year":"2022","journal-title":"Arch. Math. Log."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Swan, A. (2022). On the Nielsen-Schreier theorem in homotopy type theory. Log. Methods Comput. Sci., 18.","DOI":"10.46298\/lmcs-18(1:18)2022"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-6-1-45-95","article-title":"Sur les ensembles finis","volume":"6","author":"Tarski","year":"1924","journal-title":"Fundam. Math."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4064\/fm-46-1-1-13","article-title":"The independence of various definitions of finite","volume":"46","author":"Levy","year":"1958","journal-title":"Fundam. Math."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Halbeisen, L. (2017). Combinatorial Set Theory, With a Gentle Introduction to Forcing, Springer. [2nd ed.].","DOI":"10.1007\/978-3-319-60231-8"},{"key":"ref_15","unstructured":"Herrlich, H. (2006). The Axiom of Choice, Springer. Lecture Notes in Mathematics."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/6\/770\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:01:08Z","timestamp":1760108468000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/6\/770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,19]]},"references-count":15,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["sym16060770"],"URL":"https:\/\/doi.org\/10.3390\/sym16060770","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2024,6,19]]}}}