Amazon cover image
Image from Amazon.com

Combinatory logic. Volume II / [edited by] Haskell B. Curry, J. Roger Hindley, Jonathan P. Seldin.

Contributor(s): Series: Studies in logic and the foundations of mathematics ; v. 65.1972Description: 1 online resource (520 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780080954776
  • 0080954774
Subject(s): Genre/Form: Additional physical formats: Print version:: Combinatory logic. Volume II.LOC classification:
  • QA9.5 .C66 v.2eb
Online resources:
Contents:
Front Cover; Combinatory Logic; Copyright Page; Table of Contents; Preface; Explanation of Notations; Chapter 11 Addenda to Pure Combinatory Logic; A. Preliminaries; B. The weak theory of combinators; C. Bracket abstraction; D. The synthetic theory of combinators; E. Strong reduction; F. C-systems; Chapter 12 Foundations of the Illative Theory; A. Illative systems in general; B. Proper illative systems; C. Inferential systems for 2; D. CL-systems; Chapter 13 Combinatory Arithmetic; A. Foundations; B. Gödelian epitheory; C. Combinatory syntax; D. Typed combinatory arithmetic.
Chapter 14 The Theory of FunctionalityA. Preliminaries; B. Properties of F-deductions; C. Deductive theory of F1; D.A?-Formulation; E. An L-Formulation; F. The system F12; Chapter 15 The Theory of Restricted Generality; A. The systern F20; B. Deductive theory of F2; C. Finite formulations; D. The predicate calculus; Chapter 16 The Theory of Universal Generality; A. The system F30; B. Deductive theory of F31; C. Deductive theory of F32; D. Finite formulations; Chapter 17 Combinatory Type Theory; A. Formulations; B. Valuations and models; C. Kinds of type theory; Bibliography; Index.
Summary: Provability, Computability and Reflection.
Item type: eBooks
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references, index and errata.

Print version record.

Front Cover; Combinatory Logic; Copyright Page; Table of Contents; Preface; Explanation of Notations; Chapter 11 Addenda to Pure Combinatory Logic; A. Preliminaries; B. The weak theory of combinators; C. Bracket abstraction; D. The synthetic theory of combinators; E. Strong reduction; F. C-systems; Chapter 12 Foundations of the Illative Theory; A. Illative systems in general; B. Proper illative systems; C. Inferential systems for 2; D. CL-systems; Chapter 13 Combinatory Arithmetic; A. Foundations; B. Gödelian epitheory; C. Combinatory syntax; D. Typed combinatory arithmetic.

Chapter 14 The Theory of FunctionalityA. Preliminaries; B. Properties of F-deductions; C. Deductive theory of F1; D.A?-Formulation; E. An L-Formulation; F. The system F12; Chapter 15 The Theory of Restricted Generality; A. The systern F20; B. Deductive theory of F2; C. Finite formulations; D. The predicate calculus; Chapter 16 The Theory of Universal Generality; A. The system F30; B. Deductive theory of F31; C. Deductive theory of F32; D. Finite formulations; Chapter 17 Combinatory Type Theory; A. Formulations; B. Valuations and models; C. Kinds of type theory; Bibliography; Index.

Provability, Computability and Reflection.

Elsevier ScienceDirect All Books

Copyright © 2020 Alfaisal University Library. All Rights Reserved.
Tel: +966 11 2158948 Fax: +966 11 2157910 Email: librarian@alfaisal.edu