Definability and Computability - Siberian School of Algebra and Logic (Hardback)
  • Definability and Computability - Siberian School of Algebra and Logic (Hardback)
zoom

Definability and Computability - Siberian School of Algebra and Logic (Hardback)

(author)
£206.50
Hardback 264 Pages / Published: 30/04/1996
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the Goedel incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development. Other topics discussed are forcing, Sigma-definability, dynamic logic, and Sigma-predicates of finite types.

Publisher: Springer Science+Business Media
ISBN: 9780306110399
Number of pages: 264
Weight: 1270 g
Dimensions: 234 x 156 x 19 mm
Edition: 1996 ed.

You may also be interested in...

Introducing Infinity
Added to basket
Godel's Proof
Added to basket
£11.99
Paperback
Equation That Couldn't be Solved
Added to basket
Set Theory
Added to basket
£14.50
Paperback
Logic for Computer Science
Added to basket
An Introduction to Goedel's Theorems
Added to basket
Sets, Logic and Categories
Added to basket
Logic For Dummies
Added to basket
£13.99
Paperback
Logic
Added to basket
£10.99
Paperback
How to Prove It
Added to basket

Please sign in to write a review

Your review has been submitted successfully.