Recursion Theory and Algebra

, , , &
Journal of Symbolic Logic 51 (1):229-232 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273960

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,561

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

G. Metakides and A. Nerode. Recursion theory and algebra. Algebra and logic, Papers from the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia, edited by J. N. Crossley, Lecture notes in mathematics, vol. 450, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 209–219. - Iraj Kalantari and Allen Retzlaff. Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces. The journal of symbolic logic, vol. 42 no. 4 , pp. 481–491. - Iraj Kalantari. Major subspaces of recursively enumerable vector spaces. The journal of symbolic logic, vol. 43 , pp. 293–303. - J. Remmel. A r-maximal vector space not contained in any maximal vector space. The journal of symbolic logic, vol. 43 , pp. 430–441. - Allen Retzlaff. Simple and hyperhypersimple vector spaces. The journal of symbolic logic, vol. 43 , pp. 260–269. - J. B. Remmel. Maximal and cohesive vector spaces. The journal of symbolic logic, vol. 42 no. 3. [REVIEW]Henry A. Kierstead - 1986 - Journal of Symbolic Logic 51 (1):229-232.
Metakides G. and Nerode A.. Recursively enumerable vector spaces. Annals of mathematical logic, vol. 11 , pp. 147–171.Metakides G. and Nerode A.. Effective content of field theory. Annals of mathematical logic, vol. 17 , pp. 289–320.Metakides G. and Nerode A.. Recursion theory on fields and abstract dependence. Journal of algebra, vol. 65 , pp. 36–59. [REVIEW]A. G. Hamilton - 1983 - Journal of Symbolic Logic 48 (3):880-882.
Some remarks on a theorem of Iraj Kalantari concerning convexity and recursion theory.R. Downey - 1984 - Mathematical Logic Quarterly 30 (19‐24):295-302.
Recursion theory on orderings. I. a model theoretic setting.G. Metakides & J. B. Remmel - 1979 - Journal of Symbolic Logic 44 (3):383-402.
Some Remarks on a Theorem of Iraj Kalantari Concerning Convexity and Recursion Theory.R. Downey - 1984 - Mathematical Logic Quarterly 30 (19-24):295-302.
Simplicity in effective topology.Iraj Kalantari & Anne Leggett - 1982 - Journal of Symbolic Logic 47 (1):169-183.
Degrees of recursively enumerable topological spaces.Iraj Kalantari & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (3):610-622.
J. N. Crossley and Anil Nerode. Combinatorial functors. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 81. Springer-Verlag, New York, Heidelberg, and Berlin, 1974, VIII + 146 pp. [REVIEW]Carl E. Bredlau - 1977 - Journal of Symbolic Logic 42 (4):586-587.

Analytics

Added to PP
2015-02-05

Downloads
28 (#775,195)

6 months
3 (#1,467,341)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
Automorphisms of substructure lattices in recursive algebra.David R. Guichard - 1983 - Annals of Pure and Applied Logic 25 (1):47-58.
Maximal theories.R. G. Downey - 1987 - Annals of Pure and Applied Logic 33 (C):245-282.

View all 17 citations / Add more citations

References found in this work

No references found.

Add more references