Computability in Combinatory Spaces - An Algebraic Generalization of Abstract First Order Computability (Hardcover)

This volume provides an account of the current state of the theory of combinatory spaces and discusses various applications. Here the term "combinatory space" can be regarded as a system for functional programming and bears no close connection with combinatory logic. The main chapter is divided into three chapters. Chapter 1 deals with computational structures and computability; Chapter 2 considers combinatory spaces; and Chapter 3 embraces computability in iterative combinatory spaces. A number of appendices treats a survey of examples of combinatory spaces. All sections of the chapters contain exercises together with hints for solution where appropriate. For the reading of some parts of the book a knowledge of mathematical logic and recursive function theory would be desirable. The text is mainly aimed at researchers and specialists of mathematical logic and its applications, as well as theoretical computer scientists.

General

Imprint:	Kluwer Academic Publishers
Country of origin:	United States
Series:	Mathematics & Its Applications: East European Series, v. 55
Release date:	March 1992
First published:	March 1992
Authors:	Dimiter G. Skordev
Dimensions:	230mm (L)
Format:	Hardcover
Pages:	336
ISBN-13:	978-0-7923-1576-6
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-7923-1576-6
Barcode:	9780792315766

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!