Skip to main content
SpringerLink
Log in
Book cover

Cambridge Summer School in Mathematical Logic

Held in Cambridge /U. K., August 1-21, 1971

  • Conference proceedings
  • © 1973

Overview

Editors:
  1. A. R. D. Mathias
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. H. Rogers
    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 337)

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Pages N2-IX
    Download chapter PDF

  2. Lectures on intuitionism

    • D. van Dalen
    Pages 1-94

  3. Realizability: A retrospective survey

    • S. C. Kleene
    Pages 95-112

  4. Some applications of Kleene's methods for intuitionistic systems

    • Harvey Friedman
    Pages 113-170

  5. Notes on intuitionistic second order arithmetic

    • A. S. Troelstra
    Pages 171-205

  6. Some properties of intuitionistic zermelo-frankel set theory

    • John Myhill
    Pages 206-231

  7. Ouelques Resultats sur les Interpretations Fonctionnelles

    • J. Y. Girard
    Pages 232-252

  8. Combinator realizability of constructive finite type analysis

    • John Staples
    Pages 253-273

  9. The arithmetic theory of constructions

    • Nicolas D. Goodman
    Pages 274-298

  10. The priority method for the construction of recursively enumerable sets

    • A. H. Lachlan
    Pages 299-310

  11. Admissible ordinals and priority arguments

    • Manuel Lerman
    Pages 311-344

  12. Abstract computability versus analog-generability (a survey)

    • Marian Boykan Pour-El
    Pages 345-360

  13. Infinitary combinatorics

    • E. M. Kleinberg
    Pages 361-418

  14. The maximum sum of a family of ordinals

    • John A. H. Anderson
    Pages 419-438

  15. Effective implications between the "finite" choice axioms

    • J. H. Conway
    Pages 439-458

  16. On descendingly complete ultrafilters

    • Karel Prikry
    Pages 459-488

  17. XVI. A model for the negation of the axiom of choice

    • Kenneth Kunen
    Pages 489-494

  18. Filters closed under MAHLO's and GAIFMAN's operation

    • K. Gloede
    Pages 495-530

  19. On chromatic number of graphs and set systems

    • P. Erdös, A. Hajnal, B. Rothchild
    Pages 531-538

  20. Countable models of set theories

    • Harvey Friedman
    Pages 539-573
Back to top

Keywords

Bibliographic Information

  • Book Title: Cambridge Summer School in Mathematical Logic

  • Book Subtitle: Held in Cambridge /U. K., August 1-21, 1971

  • Editors: A. R. D. Mathias, H. Rogers

  • Series Title: Lecture Notes in Mathematics

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1973

  • Softcover ISBN: 978-3-540-05569-3Published: 15 August 1973

  • eBook ISBN: 978-3-540-36884-7Published: 15 November 2006

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: XII, 664

  • Topics: Mathematical Logic and Foundations, Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation