Skip to main content
SpringerLink
Log in

Abstract construction of counterexamples in recursive graph theory

  • Conference paper
  • First Online:
Computation and Proof Theory

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

  • 344 Accesses

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

  1. Bean, D.R., Effective coloration, Journal of Symbolic Logic, 41 (1976), 469–480.

    Article  MathSciNet  MATH  Google Scholar 

  2. Bean, D.R., Recursive Euler and Hamilton paths, Proceedings of the American Mathematical Society, 55 (1976), 385–394.

    Article  MathSciNet  MATH  Google Scholar 

  3. Carstens, H.-G., Päppinghaus, P., Recursive coloration of countable graphs, Annals of Pure and Applied Logic, 25 (1983), 19–45.

    Article  MathSciNet  MATH  Google Scholar 

  4. Carstens, H.-G., Päppinghaus, P., Extensible Algorithms, to appear.

    Google Scholar 

  5. Jockusch, C.G., π 01 clsses and boolean combinations of recursively enumerable sets, Journal of Symbolic Logic, 39 (1974), 95–96.

    Article  MathSciNet  MATH  Google Scholar 

  6. Kleene, S.C., Recursive functions and intuitionistic mathematics, Proceedings of the International Congress of Mathematicians (Cambridge, Mass., Aug. 30.–Sept. 6, 1950), Providence, R.I., 1954, Vol. 1, 679–685.

    Google Scholar 

  7. Kierstead, H.A., McNulty, G.F., Trotter, W.T., A theory of dimension for recursive ordered sets, to appear.

    Google Scholar 

  8. Kierstead, H.A., Trotter, W.T., An extremal problem in recursive combinatorics, Congressus numerantium, 33 (1981), 143–153.

    MathSciNet  MATH  Google Scholar 

  9. Manaster, A.B. Rosenstein, J.G., Effective match making (Recursion theoretic aspects of a theorem of Phillip Hall), Proceedings of the London Mathematical Society, 25 (1972), 615–645.

    Article  MathSciNet  MATH  Google Scholar 

  10. Manaster, A.B., Rosenstein, J.G., Effective match making and k-chromatic graphs, Proceedings of the American Mathematical Society, 39 (1973), 371–379.

    MathSciNet  MATH  Google Scholar 

  11. Rogers, H. Theory of recursive functions and effective computability, New York 1967.

    Google Scholar 

  12. Schmerl, J.H., Recursive colorings of graphs, Canadian Journal of Mathematics, 32 (1980), 821–830.

    Article  MathSciNet  MATH  Google Scholar 

  13. Specker, E., Eine Verschärfung des Unvollständigkeitssatzes der Zahlentheorie, Bulletin de l'Academie Polonaise des Sciences, Sér., Sci. Math. Astronom. Phys., 5 (1957), 1041–1045.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Bielefeld, Universitätsstraße, 4800, Bielefeld 1, Federal Republic of Germany

    Hans-Georg Carstens & Peter Päppinghaus

  2. Institute of Mathematics, University of Hannover, Welfengarten 1, 3000, Hannover 1, Federal Republic of Germany

    Hans-Georg Carstens & Peter Päppinghaus

Authors
  1. Hans-Georg Carstens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Päppinghaus
    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

Carstens, HG., Päppinghaus, P. (1984). Abstract construction of counterexamples in recursive graph theory. 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/BFb0099478

Download citation

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

  • 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