Computable Structures and the Hyperarithmetical Hierarchy

Available
0
StarStarStarStarStar
0Reviews
This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there...
Read more
E-book
pdf
Price
110.00 £
This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there...
Read more
Follow the Author

Options

  • Formats: pdf
  • ISBN: 9780080529523
  • Publication Date: 16 Jun 2000
  • Publisher: Elsevier Science
  • Product language: English
  • Drm Setting: DRM