{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:17Z","timestamp":1725663257278},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_32","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:42:47Z","timestamp":1330188167000},"page":"65-75","source":"Crossref","is-referenced-by-count":4,"title":["Set-theoretic reductions of Hilbert's tenth problem"],"prefix":"10.1007","author":[{"given":"D.","family":"Cantone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Cutello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"4_CR1","volume-title":"Computability, complexity, logic","author":"E. B\u00f6rger","year":"1989","unstructured":"E. B\u00f6rger. Computability, complexity, logic. North-Holland, Amsterdam, 1989."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/cpa.3160340203","volume":"XXXIV","author":"M. Breban","year":"1981","unstructured":"M. Breban, A. Ferro, E.G. Omodeo, and J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions. Comm. Pure App. Math., XXXIV:177\u2013195, 1981.","journal-title":"Comm. Pure App. Math."},{"key":"4_CR3","unstructured":"C. Cantone. A survey of computable set theory. Le Matematiche, to appear."},{"key":"4_CR4","unstructured":"D. Cantone and V. Cutello. A decision procedure for set-theoretic formulae involving rank and cardinality comparison. Proceedings of 3rd Italian Conference on Theoretical Computer Science, Mantova, pp. 150\u2013163, 1989."},{"key":"4_CR5","unstructured":"D. Cantone, A. Ferro, and E.G. Omodeo. Computable Set Theory. Oxford University Press, to appear."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1002\/cpa.3160330503","volume":"XXXIII","author":"A. Ferro","year":"1980","unstructured":"A. Ferro, E.G. Omodeo, and J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions. Comm. Pure App. Math., XXXIII:599\u2013608, 1980.","journal-title":"Comm. Pure App. Math."},{"key":"4_CR7","volume-title":"Set theory","author":"T.J. Jech","year":"1978","unstructured":"T.J. Jech. Set theory. Academic Press, New York, 1978."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"A. Levy. Basic Set Theory. Springer-Verlag, 1979.","DOI":"10.1007\/978-3-662-02308-2"},{"key":"4_CR9","first-page":"354","volume":"11","author":"Y. Matijasevi\u010d","year":"1970","unstructured":"Y. Matijasevi\u010d. Enumerable sets are Diphantine sets. Soviet Math. Doklady, 11:354\u2013357, 1970.","journal-title":"Soviet Math. Doklady"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/cpa.3160410206","volume":"XLI","author":"F. Parlamento","year":"1988","unstructured":"F. Parlamento and A. Policriti. Decision procedures for elementary sublanguages of set theory. IX. Unsolvability of the decision problem for a restricted subclass of the \u03940-formulas in set theory. Comm. Pure App. Math., XLI:221\u2013251, 1988.","journal-title":"Comm. Pure App. Math."},{"key":"4_CR11","first-page":"111","volume":"44","author":"W. Sch\u00f6nfeld","year":"1979","unstructured":"W. Sch\u00f6nfeld. An undecidability result for relation algebras. JSL, 44:111\u2013115, 1979. Refinement in: Gleichungen in der Algebra der bin\u00e4ren Relationen. Habilitationsschrift, \u00a75, Minerva Publikation, M\u00fcnchen 1981.","journal-title":"JSL"}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:09:17Z","timestamp":1619557757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}