Get Free Shipping on orders over $79
Complexity, Logic, and Recursion Theory : Lecture Notes in Pure and Applied Mathematics - Andrea Sorbi

Complexity, Logic, and Recursion Theory

By: Andrea Sorbi

Paperback | 4 February 1997 | Edition Number 1

At a Glance

Paperback


RRP $557.00

$473.75

15%OFF

or 4 interest-free payments of $118.44 with

 or 

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."

More in Mathematical Logic

Handbook of Automated Reasoning - Rachel Phillips
Current Trends in Automated Reasoning - Erika Bach
The Language of Mathematics : The Stories behind the Symbols - Raul Rojas
Unequal : The Maths of When Things Do and Don't Add Up - Eugenia Cheng
How to Prove It : A Structured Approach - Daniel J. Velleman

RRP $73.95

$70.75

Philosophical Logic : A Phenomenological Approach - Andrew  Schumann

RRP $284.99

$256.75

10%
OFF
Parabolic Problems : 60 Years of Mathematical Puzzles in Parabola - David  Angell
Blockchain and Digital Twin Applications in Smart Agriculture - Amit  Kumar Tyagi
Security, Privacy, and Trust in WBANs and E-Healthcare - Anuj Kumar  Singh
Logic For Dummies : For Dummies - Mark Zegarelli

RRP $41.95

$29.99

29%
OFF
Introduction to Modern Cryptography : Revised Third Edition - Jonathan  Katz