Effective mathematics of the uncountable /

Mostrar otras versiones (1)

Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods - some old, some new - that have extended its basic concepts to uncountable structures. Unlike in the classical case, however, no single dominant approach has emerged, and differ...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Greenberg, Noam, 1974- (Autor, Editor ), Hamkins, Joel David (Autor, Editor ), Miller, Russell (Professor of mathematics) (Autor, Editor )
Otros Autores: Hirschfeldt, Denis Roman (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: [Ithaca, NY?] : Cambridge : Association for Symbolic Logic ; Cambridge University Press, 2013.
Colección:Lecture notes in logic ; 41.
Temas:
Model theory.
Computable functions.
Théorie des modèles.
Fonctions calculables.
MATHEMATICS > General.
Computable functions
Model theory
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Some results on R-computable structures / Wesley Calvert and John E. Porter
  • Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals / Samuel Coskey and Joel David Hamkins
  • Computable structure theory using admissible recursion theory on [omega]1 using admissibility / Noam Greenberg and Julia F. Knight
  • Local computability and uncountable structures / Russell Miller
  • Borel structures : a brief survey / Antonio Montalbán and André Nies
  • E-recursive intuitions / Gerald E. Sacks
  • Reverse mathematics, countable and uncountable : a computational approach
  • Effective model theory : an approach via [Sigma]-definability.

Ejemplares similares