Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Describes a program of research in computable structure theory. This book aims to find definability conditions corresponding to bounds on complexity which persist under isomorphism. It includes necessary background material from recursion theory and model theory.
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.