Logic Colloquium '73

Proceedings of the Logic Colloquium

1 January 197307 Bristol
Edited by
  • H.E. Rose - Lecturer in Mathematics, Bristol
  • J.C. Shepherdson - Professor of Pure Mathematics, Bristol
Volume 80,

Pages ii-viii, 1-513 (1975)

Actions for selected chapters

/

Contents

    1. Editorial Board

      Page ii
      View PDF
    1. Edited by

      Page iii
      View PDF
    1. Copyright page

      Page iv
    1. Preface

      Pages vii-viii
  1. Invited Papers

    1. Mathematics as a Domain of Theoretical Science and of Mental Experience

      Pages 1-4
    2. The Philosophical Basis of Intuitionistic Logic

      Pages 5-40
    3. Concerning Progress In The Philosophy Of Mathematics

      Pages 41-52
    4. An Algebraic Characterization of Groups with Soluble Order Problem

      Pages 53-54
    5. A Hierarchy of Languages with Infinitely Long Expressions

      Pages 55-71
    6. An Intuitionistic Theory of Types: Predicative Part

      Pages 73-118
    7. Sets, Topoi, and Internal Logic in Categories

      Pages 119-134
    8. Continuously Variable Sets; Algebraic Geometry = Geometric Logic

      Pages 135-156
    9. Processes: A Mathematical Model of Computing Agents

      Pages 157-173
    10. Monadic Computation And Iterative Algebraic Theories

      Pages 175-230
    11. On the Solvability of Algorithmic Problems

      Pages 231-251
  2. Contributed Papers

    1. Combinatorial Systems II, Non-Cylindrical Problems

      Pages 253-258
    2. Embedding Algebras with Solvable Word Problems in Simple Algebras - Some Boone-Higman Type Theorems

      Pages 259-277
    3. Elimination of Higher type Levels in Definitions of Primitive Recursive Functionals by Means of Transfinite Recursion

      Pages 279-303
    4. Some Hierarchies Based on Higher Type Quantification

      Pages 305-316
    5. Analytical Wellorderings in R

      Pages 317-346
    6. Set Mappings, Partitions, and Chromatic Numbers

      Pages 347-379
    7. Interpolation Theorem for Some Modal Logics

      Pages 381-393
    8. Weak Elimination of Quantifiers and Cotheories

      Pages 395-398
    9. Independence Versus Logical Independence in the Countable Case

      Pages 399-408
    10. Securable Quantifiers, κ-Unions and Admissible Sets

      Pages 409-428
    11. Parentheses in Combinatory Logic

      Pages 429-432
    12. Equality in 22

      Pages 433-444
    13. Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes

      Pages 445-513

ISBN: 978-0-444-10642-1

ISSN: 0049-237X