{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:28:34Z","timestamp":1772447314464,"version":"3.50.1"},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":1197,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of equality. It turns out that there exists a continuum of such reducts. Equivalently, expressed in the language of universal algebra, we classify those locally closed clones over a countable domain which contain all permutations of the domain.<\/jats:p>","DOI":"10.2178\/jsl\/1286198146","type":"journal-article","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T13:16:13Z","timestamp":1286198173000},"page":"1249-1292","source":"Crossref","is-referenced-by-count":28,"title":["The reducts of equality up to primitive positive interdefinability"],"prefix":"10.1017","volume":"75","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Pinsker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200002231_ref022","first-page":"461","article-title":"The number of unary clones containing the permutations on an infinite set","volume":"71","author":"Pinsker","year":"2005","journal-title":"Acta Scientiarum Mathematicarum"},{"key":"S0022481200002231_ref019","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-007-0720-z"},{"key":"S0022481200002231_ref030","volume-title":"Clones in universal algebra","author":"Szendrei","year":"1986"},{"key":"S0022481200002231_ref023","first-page":"80","volume-title":"Proceedings of the ROGICS'08 conference","author":"Pinsker","year":"2008"},{"key":"S0022481200002231_ref024","unstructured":"] Pinsker M. , More sublattices of the lattice of local clones, preprint available from http:\/\/dmg.tuwien.ac.at\/pinsker\/."},{"key":"S0022481200002231_ref025","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5547-1"},{"key":"S0022481200002231_ref001","first-page":"203","volume-title":"LICS'07","author":"Bodirsky","year":"2007"},{"key":"S0022481200002231_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-008-2100-2"},{"key":"S0022481200002231_ref026","volume-title":"The two-valued iterative systems of mathematical logic","volume":"5","author":"Post","year":"1941"},{"key":"S0022481200002231_ref027","first-page":"389","article-title":"Locally maximal clones","volume":"18","author":"Rosenberg","year":"1982","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"S0022481200002231_ref010","unstructured":"] Goldstern M. , Analytic clones, preprint available from http:\/\/arxiv.org\/math.RA\/0404214."},{"key":"S0022481200002231_ref029","volume-title":"Logic for computer scientists","author":"Sch\u00f6ning","year":"1989"},{"key":"S0022481200002231_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/BF01214702"},{"key":"S0022481200002231_ref013","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-04-03593-7"},{"key":"S0022481200002231_ref021","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-005-1929-x"},{"key":"S0022481200002231_ref015","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012450"},{"key":"S0022481200002231_ref004","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exi083"},{"key":"S0022481200002231_ref003","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374382"},{"key":"S0022481200002231_ref005","first-page":"22","article-title":"Playing with boolean blocks, part it. constraint satisfaction problems","volume":"35","author":"B\u00f6hler","year":"2004","journal-title":"ACM SIGACT-Newsletter"},{"key":"S0022481200002231_ref007","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511549809"},{"key":"S0022481200002231_ref008","volume-title":"Algebraic theory of lattices","author":"Crawley","year":"1973"},{"key":"S0022481200002231_ref009","volume-title":"Graph theory","author":"Diestel","year":"2005"},{"key":"S0022481200002231_ref012","unstructured":"] Goldstern M. , S\u00e1gi S. , and Shelah S. , Very many clones above the unary clone, preprint."},{"key":"S0022481200002231_ref016","first-page":"861","volume":"73","author":"Junker","year":"2008","journal-title":"The 116 reducts of (\u211a, <, a)"},{"key":"S0022481200002231_ref017","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90063-5"},{"key":"S0022481200002231_ref031","first-page":"176","volume":"56","author":"Thomas","year":"1991","journal-title":"Reducts of the random graph"},{"key":"S0022481200002231_ref018","volume-title":"Function algebras on finite sets","author":"Lau","year":"2006"},{"key":"S0022481200002231_ref020","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5315-4_14"},{"key":"S0022481200002231_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9083-9"},{"key":"S0022481200002231_ref028","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"S0022481200002231_ref014","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1994-054-1"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200002231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:36:36Z","timestamp":1556397396000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200002231\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["S0022481200002231"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1286198146","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}