Cantitate/Preț
Produs

Combinators, λ-Terms and Proof Theory: Synthese Library, cartea 42

Autor S. Stenlund
en Limba Engleză Hardback – 30 sep 1972
The aim of this monograph is to present some of the basic ideas and results in pure combinatory logic and their applications to some topics in proof theory, and also to present some work of my own. Some of the material in chapter 1 and 3 has already appeared in my notes Introduction to Combinatory Logic. It appears here in revised form since the presen­ tation in my notes is inaccurate in several respects. I would like to express my gratitude to Stig Kanger for his invalu­ able advice and encouragement and also for his assistance in a wide variety of matters concerned with my study in Uppsala. I am also in­ debted to Per Martin-USf for many valuable and instructive conversa­ tions. As will be seen in chapter 4 and 5, I also owe much to the work of Dag Prawitz and W. W. Tait. My thanks also to Craig McKay who read the manuscript and made valuable suggestions. I want, however, to emphasize that the shortcomings that no doubt can be found, are my sole responsibility. Uppsala, February 1972.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 62463 lei  43-57 zile
  SPRINGER NETHERLANDS – 12 oct 2011 62463 lei  43-57 zile
Hardback (1) 63074 lei  43-57 zile
  SPRINGER NETHERLANDS – 30 sep 1972 63074 lei  43-57 zile

Din seria Synthese Library

Preț: 63074 lei

Preț vechi: 74204 lei
-15% Nou

Puncte Express: 946

Preț estimativ în valută:
12071 12575$ 10036£

Carte tipărită la comandă

Livrare economică 10-24 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789027703057
ISBN-10: 9027703051
Pagini: 192
Ilustrații: X, 177 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:1972
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Synthese Library

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

1. The Theory of Combinators and the ?-Calculus.- 1. Introduction.- 2. Informal theory of combinators.- 3. Equality and reduction.- 4. The ?-calculus.- 5. Equivalence of the ?-calculus and the theory of combinators.- 6. Set-theoretical interpretations of combinators.- 7. Illative combinatory logic and the paradoxes.- 2. The Church-Rosser Property.- 1. Introduction.- 2. R-reductions.- 3. One-step reduction.- 4. Proof of main result.- 5. Generalization.- 6. Generalized weak reduction.- 3. Combinatory Arithmetic.- 1. Introduction.- 2. Combinatory definability.- 3. Fixed-points and numeral sequences.- 4. Undecidability results.- 4. Computable Functionals of Finite Type.- 1. Introduction.- 2. Finite types and terms of finite types.- 3. The equation calculus.- 4. The role of the induction rule.- 5. Soundness of the axioms.- 6. Defining axioms and uniqueness rules.- 7. Reduction rules.- 8. Computability and normal form.- 9. Interpretation of types and terms.- 5. Proofs in the Theory of Species.- 1. Introduction.- 2. Formulas, terms and types.- 3. A-terms and deductions.- 4. The equation calculus.- 5. Reduction and normal form.- 6. The strong normalization theorem.- 7. Interpretation of types and terms.- Index of Names.- Index of Subjects.