{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:30:47Z","timestamp":1775521847700,"version":"3.50.1"},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":13160,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1978,3]]},"abstract":"<jats:p>Early work combining recursion theory and algebra had (at least) two different sets of motivations. First the precise setting of recursion theory offered a chance to make formal classical concerns as to the effective or algorithmic nature of algebraic constructions. As an added benefit the formalization gives one the opportunity of proving that certain constructions cannot be done effectively even when the original data is presented in a recursive way. One important example of this sort of approach is the work of Frohlich and Shepardson [1955] in field theory. Another motivation for the introduction of recursion theory to algebra is given by Rabin [1960]. One hopes to mathematically enrich algebra by the additional structure provided by the notion of computability much as topological structure enriches group theory. Another example of this sort is provided in Dekker [1969] and [1971] where the added structure is that of recursive equivalence types. (This particular structural view culminates in the monograph of Crossley and Nerode [1974].)<\/jats:p><jats:p>More recently there is the work of Metakides and Nerode [1975], [1977] which combines both approaches. Thus, for example, working with vector spaces they show in a very strong way that one cannot always effectively extend a given (even recursive) independent set to a basis for a (recursive) vector space.<\/jats:p>","DOI":"10.2307\/2271945","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T21:46:34Z","timestamp":1146951994000},"page":"13-22","source":"Crossref","is-referenced-by-count":22,"title":["Controlling the dependence degree of a recursively enumerable vector space"],"prefix":"10.1017","volume":"43","author":[{"given":"Richard A.","family":"Shore","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200049859_ref005","first-page":"407","article-title":"Effective procedures in field theory","volume":"284","author":"Fr\u00f6lich","year":"1955","journal-title":"Philisophical Tranactions of the Royal Society of London"},{"key":"S0022481200049859_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0062858"},{"key":"S0022481200049859_ref004","first-page":"477","volume":"36","author":"Dekker","year":"1971","journal-title":"Countable vector spaces with recursive operations. Part II"},{"key":"S0022481200049859_ref007","doi-asserted-by":"crossref","DOI":"10.2307\/2271869","volume-title":"Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces","author":"Kalantari","year":"1977"},{"key":"S0022481200049859_ref014","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200049859_ref013","unstructured":"Retzlaff A. [1977a], Simple and hyperhypersimple vector spaces (to appear)."},{"key":"S0022481200049859_ref001","first-page":"79","volume":"36","author":"Baldwin","year":"1971","journal-title":"On strongly minimal sets"},{"key":"S0022481200049859_ref010","first-page":"341","article-title":"Computable algebra, general theory and theory of computable fields","volume":"95","author":"Rabin","year":"1960","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200049859_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85933-5"},{"key":"S0022481200049859_ref003","first-page":"363","volume":"34","author":"Dekker","year":"1969","journal-title":"Countable vector spaces with recursive operations. Part I"},{"key":"S0022481200049859_ref011","unstructured":"Remmel J. [1977], Maximal and cohesive spaces (to appear)."},{"key":"S0022481200049859_ref009","volume-title":"Annals of Mathematical Logic","author":"Metakides","year":"1977"},{"key":"S0022481200049859_ref006","unstructured":"Kalantari I. [1976], Structural properties of the lattice of recursive enumerable vector spaces, Ph.D. thesis, Cornell University, Ithaca, N.Y., 1976."},{"key":"S0022481200049859_ref012","unstructured":"Retzlaff A. [1977], Direct summands of recursively enumerable vector spaces (to appear)."}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200049859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:19:41Z","timestamp":1558988381000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200049859\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,3]]}},"alternative-id":["S0022481200049859"],"URL":"https:\/\/doi.org\/10.2307\/2271945","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,3]]}}}