Cargando…

Logic, Computation, Hierarchies.

<!Doctype html public ""-//w3c//dtd html 4.0 transitional//en""> <html><head> <meta content=""text/html; charset=iso-8859-1"" http-equiv=content-type> <meta name=generator content=""mshtml 8.00.6001.23644""><...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Brattka, Vasco (Editor ), Diener, Hannes (Editor ), Spreen, Dieter (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Boston : De Gruyter, [2014]
Colección:Ontos mathematical logic.
Temas:
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Preface; Contents; The life and work of Victor L. Selivanov; Tight extensions of T0-quasi-metric spaces; On the strongly bounded turing degrees of simple sets; Levels of discontinuity, limit-computability, and jump operators; The wadge hierarchy of Petri Nets?-languages; Diophantine properties of brownian motion: recursive aspects; The completeness of isomorphism; Complexity issues for Preorders on finite labeled forests; Boolean algebras of regular quasi-aperiodic languages; A simple indeterminate infinite game
  • Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spacesON THE EQUIVALENCE OF PARACONSISTENT AND EXPLOSIVE VERSIONS OF NELSON LOGIC; COMPUTING CLEBSCH-GORDAN MATRICES WITH APPLICATIONS IN ELASTICITY THEORY; AN APPROACH TO DESIGN OF AUTOMATA-BASED AXIOMATIZATION FOR PROPOSITIONAL PROGRAM AND TEMPORAL LOGICS (BY EXAMPLE OF LINEAR TEMPORAL LOGIC); PARTIAL NUMBERINGS AND PRECOMPLETENESS; AN ISOMORPHISM THEOREM FOR PARTIAL NUMBERINGS; TWO THEOREMS ON THE HAUSDORFF MEASURE OF REGULAR?-LANGUAGES; SOME NOTES ON THE UNIVERSALITY OF THREE-ORDERS ON FINITE LABELED POSETS; INDEX