Computable structures and the hyperarithmetical hierarchy /

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 alge...

Full description

Bibliographic Details

Main Author:	Ash, C. J.
Corporate Author:	ScienceDirect (Online service)
Other Authors:	Knight, J. (Julia)
Format:	eBook
Language:	English
Published:	Amsterdam ; New York : Elsevier, 2000.
Edition:	1st ed.
Series:	Studies in logic and the foundations of mathematics ; v. 144.
Subjects:	Computable functions. Fonctions calculables. MATHEMATICS > Infinity. MATHEMATICS > Logic. Computable functions Wiskundige logica. Récursivité, Théorie de la. Electronic books.
Online Access:	Connect to the full text of this electronic book