Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York :
Elsevier,
2000.
|
| Edición: | 1st ed. |
| Colección: | Studies in logic and the foundations of mathematics ;
v. 144. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
Internet
Texto completoTexto completo
Texto completo