{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:42:51Z","timestamp":1769578971912,"version":"3.49.0"},"reference-count":33,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T00:00:00Z","timestamp":1769385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100004505","name":"Universit\u00e0 di Catania","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004505","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Centre for HPC"},{"name":"Big Data and Quantum Computing"},{"name":"European Union\u2014NextGenerationEU"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The celebrated Ackermann encoding of hereditarily finite sets is generalized to a parametric formula designed to map not only these sets but also hereditarily finite multisets and hypersets into the non-negative real numbers. This extension suggests a novel approach to the graph canonization problem by reducing it to a simple comparison of real values. By suitably varying the sole parameter of this formula, both the original Ackermann encoding and another previously studied map emerge as special cases. When the parameter is chosen from the natural numbers, the function yields a bijective encoding of a subuniverse of hereditarily finite multisets into the natural numbers. If, instead, the parameter is chosen to be transcendental and lies within a specific interval on the positive real line, the function is conjectured to provide an injective encoding of both multisets and hypersets.<\/jats:p>","DOI":"10.1093\/logcom\/exaf070","type":"journal-article","created":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:58:05Z","timestamp":1762865885000},"source":"Crossref","is-referenced-by-count":0,"title":["The Ackermann encoding and its siblings"],"prefix":"10.1093","volume":"36","author":[{"given":"Simone","family":"Boscaratto","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica, Informatica e Fisica, Universit\u00e0 degli Studi di Udine , Via delle Scienze, 206, 33100 Udine ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenico","family":"Cantone","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica, Universit\u00e0 degli Studi di Catania , Viale Andrea Doria, 6, 95125 Catania ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenio G","family":"Omodeo","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica, Informatica e Geoscienze, Universit\u00e0 degli Studi di Trieste , Via Valerio, 12\/1, 34127 Trieste ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica, Informatica e Fisica, Universit\u00e0 degli Studi di Udine , Via delle Scienze, 206, 33100 Udine ,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2026,1,26]]},"reference":[{"key":"2026012711401770100_ref1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01594179","article-title":"Die widerspruchsfreiheit der allgemeinen mengenlehre","volume":"114","author":"Ackermann","year":"1937","journal-title":"Mathematische Annalen"},{"key":"2026012711401770100_ref2","volume-title":"Non-Well-Founded Sets","author":"Aczel","year":"1988"},{"key":"2026012711401770100_ref3","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1080\/00029890.2004.11920128","article-title":"Iterated exponentials","volume":"111","author":"Anderson","year":"2004","journal-title":"The American Mathematical Monthly"},{"key":"2026012711401770100_ref4","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1145\/3313276.3316356","article-title":"Canonical form for graphs in quasipolynomial time: preliminary report","volume-title":"STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","author":"Babai","year":"2019"},{"key":"2026012711401770100_ref5","volume-title":"Vicious Circles","author":"Barwise","year":"1996"},{"key":"2026012711401770100_ref6","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1305\/ndjfl\/1093634995","article-title":"Multiset theory","volume":"30","author":"Blizard","year":"1988","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"2026012711401770100_ref7","doi-asserted-by":"publisher","DOI":"10.13140\/RG.2.2.14622.65604","volume-title":"Encodings of Sets, Hypersets, and Multisets,","author":"Boscaratto","year":"2024"},{"key":"2026012711401770100_ref8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01456931","article-title":"\u00dcber Abbildungen von Mannigfaltigkeiten","volume":"71","author":"Brouwer","year":"1911","journal-title":"Mathematische Annalen"},{"key":"2026012711401770100_ref9","first-page":"2","article-title":"Encoding sets as real numbers","volume-title":"Proceedings of the 3rd International Workshop on Sets and Tools co-located with the 6th International ABZ Conference, SETS@ABZ 2018, Southamptom, UK, June 5, 2018","author":"Cantone","year":"2018"},{"key":"2026012711401770100_ref10","doi-asserted-by":"publisher","DOI":"10.13137\/2464-8728\/33312","article-title":"Squeezing multisets into real numbers","author":"Cantone","year":"2021"},{"key":"2026012711401770100_ref11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02124750","article-title":"On the Lambert W function","volume":"5","author":"Corless","year":"1996","journal-title":"Advances in Computational Mathematics"},{"key":"2026012711401770100_ref12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s001530100110","article-title":"Finality regained: A coalgebraic study of Scott-sets and multisets","volume":"41","author":"D\u2019Agostino","year":"2002","journal-title":"Archive for Mathematical Logic"},{"key":"2026012711401770100_ref13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.3233\/FI-2015-1256","article-title":"Mapping sets and hypersets into numbers","volume":"140","author":"D\u2019Agostino","year":"2015","journal-title":"Fundamenta Informaticae"},{"key":"2026012711401770100_ref14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1215\/00294527-2688042","article-title":"A single-sorted theory of multisets","volume":"55","author":"Dang","year":"2014","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"2026012711401770100_ref15","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Communications of the ACM"},{"key":"2026012711401770100_ref16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-36235","article-title":"A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms","volume":"36","author":"Dovier","year":"1998","journal-title":"Fundam. Informaticae"},{"key":"2026012711401770100_ref17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","article-title":"An efficient algorithm for computing bisimulation equivalence","volume":"311","author":"Dovier","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"2026012711401770100_ref18","first-page":"38","article-title":"De formulis exponentialibus replicatis","volume":"1777","author":"Euler","year":"1778","journal-title":"Acta Academiae Scientiarum Imperialis Petropolitanae"},{"key":"2026012711401770100_ref19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3568025","article-title":"Canonisation and definability for graphs of bounded rank width","volume":"24","author":"Grohe","year":"2023","journal-title":"ACM Transactions on Computational Logic"},{"key":"2026012711401770100_ref20","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1080\/00029890.1981.11995239","article-title":"Exponentials reiterated","volume":"88","author":"Knoebel","year":"1981","journal-title":"The American Mathematical Monthly"},{"key":"2026012711401770100_ref21","volume-title":"Set Theory, Studies in Logic","author":"Kunen","year":"2011"},{"key":"2026012711401770100_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7939-1","volume-title":"Introduction to Topological Manifolds","author":"Lee","year":"2010"},{"key":"2026012711401770100_ref23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0304-3975(98)00312-0","article-title":"Linear ordering on graphs, anti-founded sets and polynomial time computability","volume":"224","author":"Lisitsa","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"2026012711401770100_ref24","volume-title":"Bounded Multi-Hyperset Theory and Polynomial Computability","author":"Lisitsa","year":"2006"},{"key":"2026012711401770100_ref25","doi-asserted-by":"publisher","article-title":"Practical graph isomorphism, II","author":"McKay","DOI":"10.1016\/j.jsc.2013.09.0032013"},{"key":"2026012711401770100_ref26","first-page":"211","article-title":"Bisimilarity, hypersets, and stable partitioning: a survey","volume":"42","author":"Omodeo","year":"2010","journal-title":"Rendiconti dell\u2019Istituto di Matematica dell\u2019Universit\u00e0 di Trieste"},{"key":"2026012711401770100_ref27","first-page":"55","article-title":"Che genere di insiemi\/multi-insiemi\/iperinsiemi incorporare nella programmazione logica?","volume-title":"Atti Dell\u2019ottavo Convegno Sulla Programmazione Logica, Hotel Capo Suvero Gizzeria, Italy, June 15\u201318, 1993","author":"Omodeo","year":"1993"},{"key":"2026012711401770100_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54981-1","volume-title":"On Sets and Graphs: Perspectives on Logic and Combinatorics","author":"Omodeo","year":"2017"},{"key":"2026012711401770100_ref29","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM Journal on Computing"},{"key":"2026012711401770100_ref30","first-page":"235","article-title":"Encodings of sets and hypersets","volume-title":"Proceedings of the 28th Italian Conference on Computational Logic, Catania, Italy, September 25\u201327, 2013","author":"Policriti","year":"2013"},{"key":"2026012711401770100_ref31","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1086\/289442","article-title":"Syntax, semantics, and the problem of the identity of mathematical objects","volume":"55","author":"Rota","year":"1988","journal-title":"Philosophy of Science"},{"key":"2026012711401770100_ref32","volume-title":"A Formalization of Set Theory without Variables, Number v. 41 in a Formalization of Set Theory without Variables","author":"Tarski","year":"1987"},{"key":"2026012711401770100_ref33","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu062","volume-title":"Journal of Logic and Computation,","author":"Audrito","year":"2015"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/2\/exaf070\/66591360\/exaf070.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/36\/2\/exaf070\/66591360\/exaf070.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T16:40:28Z","timestamp":1769532028000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/doi\/10.1093\/logcom\/exaf070\/8442316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,26]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,1,26]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exaf070","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,3]]},"published":{"date-parts":[[2026,1,26]]},"article-number":"exaf070"}}