Recursion Theory
Regular price
€254.20
A01=Joseph R. Shoenfield
Arithmetical Hierarchy
Author_Joseph R. Shoenfield
basic
Basic Machine
Binary Relation Symbol
Bounded Quantifiers
Capital Latin Letters
Category=PBCH
Church's Thesis
churchs
Church’s Thesis
Computable Function
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Existential Quantifier
Explicit Definitions
Follow
form
function
functions
Holds
Inductive Definition
Joseph R. Shoenfield
Lower Case Greek Letters
machine
normal
Normal Form Theorem
Program Holder
Real Quantifier
Recursion Theorem
Recursion Theory
recursive
Recursive Function
Recursive Set
Register Ri
Rigorous Mathematical Definition
Set A
theorem
total
Total Function
Universal Quantifier
Product details
- ISBN 9781138466876
- Weight: 453g
- Dimensions: 156 x 234mm
- Publication Date: 09 Aug 2017
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.
