Skip to main content
SpringerLink
Log in

Undecidability and recursive equivalence II

  • Conference paper
  • First Online:
Computation and Proof Theory

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

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
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

  • CROSSLEY, J.N. (1965) Constructive order types, I, pp. 189–264 in Formal Systems and Recursive Functions, ed. J.N. Crossley and M.A.E. Dummett, North-Holland Publishing Co., Amsterdam, 1965.

    Chapter  Google Scholar 

  • (1969) Constructive order types. North-Holland Publishing Co., Amsterdam (1969)

    MATH  Google Scholar 

  • CROSSLEY, J.N. & A. NERODE (1974) Combinatorial functors. Ergebnisse der Math. und ihrer Grenzgebiete, 81. Springer, Berlin (1974).

    Book  MATH  Google Scholar 

  • (1975) Combinatorial functors, pp. 1–21 in Logic Colloguium (Boston, Mass., 1972–1973), Springer Lecture Notes in Math. 453 Springer, Berlin (1975).

    Google Scholar 

  • (1981) Recursive equivalence on matroids, pp. 69–86 in Aspects of effective algebra, ed. J.N. Crossley, U.D.A. Book Co., Steel's Creek, Australia (1981).

    Google Scholar 

  • CROSSLEY, J.N. & J.B. REMMEL (1983) Undecidability and recursive equivalence, I. To appear in Proc. Southeast Asian Logic Conference (Singapore, 1981), ed. Chong Chi-Tat.

    Google Scholar 

  • DEKKER, J.C.E. (1969) Countable vector spaces with recursive operations, Part 1. J. Symbolic Logic 34 (1969), 363–387.

    Article  MathSciNet  MATH  Google Scholar 

  • DEKKER, J.C.E. & J. MYHILL (1960) Recursive equivalence types. Univ. of Calif. publications in mathematics, n.s. 3 (1960), 67–214.

    MathSciNet  MATH  Google Scholar 

  • HAMILTON, A.G. (1970) Bases and α-dimensions of countable vector spaces with recursive operations. J. Symbolic Logic, 35 (1970), 85–96.

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • JACOBSON, N. (1953) Lectures in abstract algebra, Vol. II. D. Van Nostrand Co., New York (1953).

    Book  MATH  Google Scholar 

  • MANASTER, A.B. (1966) Higher order indecomposable isols. Trans. Amer. Math. Soc. 125 (1966), 363–383.

    Article  MathSciNet  MATH  Google Scholar 

  • MANASTER, A.B. & A. NERODE (1970) A universal embedding property of the RETs. J. Symbolic Logic 35 (1970), 51–59.

    Article  MathSciNet  MATH  Google Scholar 

  • (1971) The degree of the theory of addition of isols (abstract). Notices Amer. Math. Soc. 18 (1971), 68-OZ-3, 86.

    Google Scholar 

  • METAKIDES, G. & A. NERODE (1977) Recursively enumerable vector spaces. Ann. Math. Logic. 11 (1977), 147–171.

    Article  MathSciNet  MATH  Google Scholar 

  • MONK, J.D. (1976) Mathematical logic. Springer, Berlin (1976).

    Book  MATH  Google Scholar 

  • NERODE, A & R. SHORE (1980) Second order logic and first order theories of reducibility orderings, pp. 181–200 in the Kleene Symposium ed. J. Barwise, H.J. Keisler and K. Kunen, North-Holland Publishing Co., Amsterdam (1980).

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • WELSH, D.J.A. (1976) Matroid theory. Academic Press, London (1976).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Monash University, Clayton, 3168, Victoria, Australia

    J. N. Crossley

  2. University of California, 92093, La Jolla, CA, USA

    J. B. Remmel

Authors
  1. J. N. Crossley
    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

Egon Börger Walter Oberschelp Michael M. Richter Brigitta Schinzel Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Crossley, J.N., Remmel, J.B. (1984). Undecidability and recursive equivalence II. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099480

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13901-0

  • Online ISBN: 978-3-540-39119-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation