Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1984

Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983

Part 2: Computation and Proof Theory

Editors:

  1. Egon Börger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Walter Oberschelp
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Michael M. Richter
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Brigitta Schinzel
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Wolfgang Thomas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Sections

Buy it now

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

Other ways to access

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

Table of contents (21 papers)

  1. Front Matter

    Pages I-VIII
    PDF

  2. Contiguous R.E. Degrees

    • Klaus Ambos-Spies
    Pages 1-37

  3. Abstract construction of counterexamples in recursive graph theory

    • Hans-Georg Carstens, Peter Päppinghaus
    Pages 39-62

  4. Minimal degrees and 1-generic sets below 0′

    • C. T. Chong, C. G. Jockusch
    Pages 63-77

  5. Undecidability and recursive equivalence II

    • J. N. Crossley, J. B. Remmel
    Pages 79-100

  6. Logical syntax and computational complexity

    • Larry Denenberg, Harry R. Lewis
    Pages 101-115

  7. Subrecursive hierarchies via direct limits

    • E. C. Dennis-Jones, S. S. Wainer
    Pages 117-128

  8. A star-finite relational semantics for parallel programs

    • E. J. Farkas, M. E. Szabo
    Pages 129-142

  9. Between constructive and classical mathematics

    • Solomon Feferman
    Pages 143-162

  12. On a new notion of partial conservativity

    • Petr Hájek
    Pages 217-232

  13. Finitely approximable sets

    • Peter G. Hinman
    Pages 233-258

  14. A unified approach to constructive and recursive analysis

    • Christoph Kreitz, Klaus Weihrauch
    Pages 259-278

  15. On faithful interpretability

    • Per Lindström
    Pages 279-288
Back to top

Keywords

Back to top

Bibliographic Information

  • Book Title: Proceedings of the Logic Colloquium. Held in Aachen, July 18-23, 1983

  • Book Subtitle: Part 2: Computation and Proof Theory

  • Editors: Egon Börger, Walter Oberschelp, Michael M. Richter, Brigitta Schinzel, Wolfgang Thomas

  • Series Title: Lecture Notes in Mathematics

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1984

  • Softcover ISBN: 978-3-540-13901-0Published: 01 December 1984

  • eBook ISBN: 978-3-540-39119-7Published: 08 December 2006

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: X, 482

  • Topics: Mathematical Logic and Foundations

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Other ways to access

Search

Navigation