Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
  • List Price: $115.95
  • Save: $26.96 (23%)
Only 3 left in stock (more on the way).
Ships from and sold by
Gift-wrap available.
Sell yours for a Gift Card
We'll buy it for $2.00
Learn More
Sell It Now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Combinatory Logic: Pure, Applied and Typed (Discrete Mathematics and Its Applications) Hardcover – July 27, 2011

ISBN-13: 978-1439800003 ISBN-10: 1439800006 Edition: 1st

Buy New
Price: $88.99
24 New from $85.84 15 Used from $85.79
Rent from Amazon Price New from Used from
"Please retry"
"Please retry"
$85.84 $85.79
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Best Books of the Year
See the Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.
Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Series: Discrete Mathematics and Its Applications
  • Hardcover: 357 pages
  • Publisher: Chapman and Hall/CRC; 1 edition (July 27, 2011)
  • Language: English
  • ISBN-10: 1439800006
  • ISBN-13: 978-1439800003
  • Product Dimensions: 0.8 x 6.2 x 9.5 inches
  • Shipping Weight: 1.2 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #3,230,402 in Books (See Top 100 in Books)

Editorial Reviews


For beginners, it is a compact introduction, including exercises, to the classical syntactic theory of combinators with some pointers to their models and their relation with λ-calculus. More advanced readers may find in the book much information on the connections between combinators and non-classical and substructural logics that are now a prominent topic in several areas, from philosophical logic to theoretical computer science, information that is mostly scattered through the research literature.

One of the commendable aspects of the book is its extensive and up-to-date bibliography, which deals with CL and other relevant topics in logic; it will surely aid many readers who may need to brush up on background information in the course of their study.
—Computing Reviews, 2012

About the Author

Katalin Bimbo is an assistant professor in the Department of Philosophy at the University of Alberta in Edmonton, Canada.

More About the Author

Katalin Bimbó is a logician. She works at the University of Alberta in Canada. Earlier, she held academic positions at other universities including Indiana University Bloomington (USA), Victoria University of Wellington (New Zealand) and the Australian National University (Australia).

Katalin Bimbó's main research interests are in the field of nonclassical logics such as combinatory logic, relevance logics, modal logics, substructural and structurally free logics. She solved (with J. Michael Dunn) a long-open problem concerning the decidability of the logic of implicational ticket entailment -- using sequent calculi. Her research spans the semantics and the proof theory of classical and nonclassical logics.

Customer Reviews

5.0 out of 5 stars
5 star
4 star
3 star
2 star
1 star
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

1 of 1 people found the following review helpful By King Yin Yan on September 23, 2011
Format: Hardcover Verified Purchase
Table of contents:
1. elements of combinatory logic
2. main theorems
3. recursive functions and arithmetic
4. connections to lambda-calculi
5. (in)equational combinatory logic
6. models
7. dual and symmetric combinatory logics
8. applied combinatory logic
9. typed combinatory logic

I have just skimmed through the book. It seems to be written in a very clear style, explaining the rationale behind the study of combo logic and its historical roots.

The author is interested in applying combo logic to the study of linear / substructural logics, whereas I'm interested in the untyped aspect of illative logic.

Ch 7 deals with duality, ie, where f(n) is the function f applied to the number n, it can be dually encoded as the number n applied to f. This is new to me.

Ch 8 deals briefly with illative combo logic.

My library doesn't have this book, so I bought it and keep it as a reference.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again