Skip to main content
SpringerLink
Log in

Generic objects in recursion theory

  • Conference paper
  • First Online:
Recursion Theory Week

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1141))

Supported in part by NSF grant MCS-8301850

Supported in part by NSF grant MCS-8202333

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ash, C. J., and Nerode, A., Intrinsically recursive relations, in Aspects of Effective Algebra (J.N. Crossley, ed.), Upside Down A Book Co., Box 226, Yarra Glen, Victoria, Australia (1981), 26–41.

    Google Scholar 

  • Cohen, P., The independence of the continuum hypothesis, Proc. Nat. Acad. Sci. USA 50 (1963), 1143–1148.

    Article  MathSciNet  MATH  Google Scholar 

  • Cohen, P., Set theory and the continuum hypothesis, Benjamin, N.Y., 1965.

    Google Scholar 

  • Crossley, J. N., and Nerode, A., Combinatorial Functors, Ergebnisse der Mathematik, Band 81, Springer-Verlag, Berlin, 1974.

    Book  MATH  Google Scholar 

  • Downey, R., and Hird, J., Strongly supermaximal spaces, to appear (1985).

    Google Scholar 

  • Friedberg, R. M., Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Nat. Acad. Sciences USA 43 (1957), 236–8.

    Article  MathSciNet  MATH  Google Scholar 

  • Friedberg., R. M., Three theorems on recursive enumeration, J. Symb. Logic 23 (1958), 309–316.

    Article  MathSciNet  MATH  Google Scholar 

  • Goncharov, S. S., Constructivisable superatomic boolean algebras, Algebra i Logika, 12 (1973), 31–40.

    MathSciNet  Google Scholar 

  • Goncharov, S.S., Some properties of constructivizations of boolean algebra, Sibirski Math. Zh. 16 (1975), 264–278.

    Google Scholar 

  • Goncharov, S. S. and Nurtazin, A. T., Constructive models of complete solvable theories, Algebra i Logika 12 (1973), 125–142.

    Article  MathSciNet  MATH  Google Scholar 

  • Guichard, D., Automorphisms of substructure lattices in recursive algebra, Ann. Math. Logic 25 (1983), 47–58.

    MathSciNet  MATH  Google Scholar 

  • Hay, L., The co-simple isols, Ann. of Math. 83 (no. 2) (1966), 231–256.

    Article  MathSciNet  MATH  Google Scholar 

  • Jockusch, C., Genericity for recursively enumerable sets (1982), (unpublished).

    Google Scholar 

  • Kleene, S. C., Post, E. L., The upper semi-lattice of degrees of recursive unsolvability, Ann. of Math 59 (1954), 379–407.

    Article  MathSciNet  MATH  Google Scholar 

  • Lachlan, A. H., On some games which are relevant to the theory of recursively enumerable sets, Ann. of Math. 91 (1970), 291–310.

    Article  MathSciNet  MATH  Google Scholar 

  • Maass, W., Recursively enumerable generic sets, J. Symb. Logic 47 (1982), 809–823.

    Article  MathSciNet  MATH  Google Scholar 

  • Metakides, G., Nerode, A., Recursively enumerable vector spaces, Ann. of Math. Logic 11 (1977), 141–171.

    Article  MathSciNet  MATH  Google Scholar 

  • Metakides, G., Nerode, A., Recursion theory on fields and abstract dependence, J. Algebra 65 (1980), 36–59.

    Article  MathSciNet  MATH  Google Scholar 

  • Muchnik, A. A., On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl. Akad. Nauk SSR 108 (1956), 194–197.

    MathSciNet  MATH  Google Scholar 

  • Myhill, J. Category methods in recursion theory, Pac. J. Math. 11 (1961), 1479–1486.

    Article  MathSciNet  MATH  Google Scholar 

  • Nerode, A. Extensions to isols, Ann. of Math. 73 (1961), 362–403.

    Article  MathSciNet  MATH  Google Scholar 

  • Nerode, A., Remmel, J. B., A survey of r. e. substructures, Proc. of AMS 1982 Summer Institute in Recursion Theory, to appear (1985).

    Google Scholar 

  • Post, E. L., Recursively enumerable sets of integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316.

    Article  MathSciNet  MATH  Google Scholar 

  • Remmel, J. B., Combinatorial functors on co-r. e. structures, Ann. Math. Logic 11 (1976), 261–287.

    Article  MathSciNet  MATH  Google Scholar 

  • Remmel, J. B., Recursively enumerable boolean algebras, Ann. Math. Logic 14 (1978), 75–107.

    Article  MathSciNet  MATH  Google Scholar 

  • Remmel, J. B., Complementation in the lattice of subalgebras of a boolean algebra, Algebra Universalis 10 (1980), 48–64.

    Article  MathSciNet  MATH  Google Scholar 

  • Remmel, J. B., Recursive boolean algebra with recursive atoms, J. Symb. Logic 46 (1981), 595–616.

    Article  MathSciNet  MATH  Google Scholar 

  • Remmel, J. B., Recursive isomorphism types of recursive boolean algebras, J. Symb. Logic 46 (1981), 572–594.

    Article  MathSciNet  MATH  Google Scholar 

  • Rogers, H. Theory of recursive functions and effective computability, McGraw Hill, New York, 1967.

    MATH  Google Scholar 

  • Sacks, G. E., A minimal degree less than O′, Ann. of Math. 77, 211–231, (1963).

    Article  MathSciNet  MATH  Google Scholar 

  • Sacks, G.E. Degrees of unsolvability, Ann. of Math. Studies 55, Princeton University Press, Princeton, New Jersey, 1963, (revised edition 1966).

    MATH  Google Scholar 

  • Shoenfield, J. On degrees of unsolvability, Ann. of Math. 69 (1959), 644–653.

    Article  MathSciNet  MATH  Google Scholar 

  • Soare, R. I., Automorphisms of the lattice of recursively enumerable sets, Part I: maximal sets, Ann. of Math. 100 (1974), 80–120.

    Article  MathSciNet  MATH  Google Scholar 

  • Solovay, R., A model of set theory in which every set is Lebesgue measurable, Ann. of Math. 92 (1970), 1–56.

    Article  MathSciNet  MATH  Google Scholar 

  • Spector, C., On degrees of recursive unsolvability, Ann. of Math. 64 (1956), 581–592.

    Article  MathSciNet  MATH  Google Scholar 

  • Yates, M., Prioric games and minimal degrees below O′, Fund. Math. 82 (1974), 217–237.

    MathSciNet  MATH  Google Scholar 

  • Yates, M., Banach-Mazur games, comeager sets, and degrees of unsolvability, Math. Proc. Camb. Phil. Soc. 79 (1976), 195–220.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Cornell University, 14853, Ithaca, New York

    A. Nerode & J. B. Remmel

  2. Department of Mathematics, University of California at San Diego, 92093, La Jolla, California

    A. Nerode & J. B. Remmel

Authors
  1. A. Nerode
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. B. Remmel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heinz-Dieter Ebbinghaus Gert H. Müller Gerald E. Sacks

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Nerode, A., Remmel, J.B. (1985). Generic objects in recursion theory. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076226

Download citation

  • DOI: https://doi.org/10.1007/BFb0076226

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15673-4

  • Online ISBN: 978-3-540-39596-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation