[1825 days] Computable Structures and the Hyperarithmetical Hierarchy
CHI TIẾT SẢN PHẨM
Mã sản phẩm:
9780444500724
Tồn kho:
Còn hàng
Danh mục
Nhà xuất bản:
Loại bìa:
Page Fidelity
Ngôn ngữ:
English
Tác giả:
Ash, C.J.; Knight, J.
Special Price 4,318,000 VNĐ
Còn 100,000,000,000,000,000 VNĐ nữa bạn sẽ được miễn phí giao hàngTìm hiểu thêm
Số lượng
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 are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).