LOGIC COLLOQUIUM '69 (eBook)

Front Cover 1
Logic Colloquium '69 4
Copyright Page 5
Contents 10
Preface 8
List of participants 14
Part I: Summer school lectures 16
Chapter 1. Recursion theoretic structures for relational systems 18
Chapter 2. Measurable cardinals 34
Part II: Invited papers on set theory 66
Chapter 3. Infinitary methods in the model theory of set theory 68
Chapter 4. On semisets 82
Chapter 5. Computability over the continuum 92
Chapter 6.On the GCH at measurable cardinals 122
Part III: Invited papers on generalisations of recursion theory 126
Chapter 7. Axiomatic recursive function theory 128
Chapter 8. Some reasons for generalising recursion theory 154
Chapter 9. Axioms for computation theories – first draft 214
Chapter 10. A countable hierarchy for the superjump 272
Chapter 11. Recursively Mahlo ordinals and inductive definitions 288
Chapter 12. F-recursiveness 304
Part IV: Invited papers on other topics 320
Chapter 13. A simplified proof for the unsolvability of the decision problem in the case 322
Chapter 14. An intrinsic characterisation of the hierarchy of constructible sets of integers 326
Part V: Contributed papers 366
Chapter 15. Standard and non-standard methods in uniform topology 368
Chapter 16. Algorithmic procedures, generalised Turing algorithms and elementary recursion theories 376
Chapter 17. Semantic proof of Craig’s interpolation theorem for intuitionistic logic and extensions, Part I 406
Chapter 18. Semantic proof of Craig’s interpolation theorem for intuitionistic logic and extensions, Part II 418
Chapter 19. Kreisel’s writings on the philosophy of mathematics 426
Chapter 20. Ramsey’s theorem does not hold in recursive set theory 454
Chapter 21. A note on arithmetical sets of indiscernibles 458