{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T16:53:46Z","timestamp":1763225626620},"reference-count":0,"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":17998,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1964,12]]},"abstract":"<jats:p>In this note we point out a limitation of the treatment of transfinite recursion in Quine's <jats:bold><jats:italic>Set Theory and its Logic<jats:sup>2<\/jats:sup><\/jats:italic><\/jats:bold> and develop a method for overcoming it. We shall also mention and indicate how to overcome a second more trivial limitation. We assume familiarity with <jats:bold><jats:italic>Set Theory and its Logic<\/jats:italic><\/jats:bold> and use its notation and terminology. Numbered references are to Quine's numbered formulae. In our work we continue the numbering of \u00a7 26.<\/jats:p><jats:p>The first difficulty is that the theorems which show that his device for defining functions by transfinite recursion (\u00a7 25) accomplishes its purpose do not apply to functions defined by recursion over all the ordinals. Let <jats:italic>\u03b3<\/jats:italic> be the function which gives the value of the function we want for an ordinal y from the sequence of its values for ordinals less than y.<\/jats:p>","DOI":"10.2307\/2270371","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T20:26:14Z","timestamp":1146947174000},"page":"179-182","source":"Crossref","is-referenced-by-count":3,"title":["A note on Quine's treatment of transfinite recursion"],"prefix":"10.1017","volume":"29","author":[{"given":"Charles","family":"Parsons","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200115816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T20:05:35Z","timestamp":1559592335000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200115816\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1964,12]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1964,12]]}},"alternative-id":["S0022481200115816"],"URL":"https:\/\/doi.org\/10.2307\/2270371","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1964,12]]}}}