Logic, Computation, Hierarchies.

Afficher d'autres versions (1)

<!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""><...

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Autres auteurs: Brattka, Vasco (Éditeur intellectuel), Diener, Hannes (Éditeur intellectuel), Spreen, Dieter (Éditeur intellectuel)
Format: Électronique eBook
Langue:Inglés
Publié: Boston : De Gruyter, [2014]
Collection:Ontos mathematical logic.
Sujets:
Logic, Symbolic and mathematical > Congresses.
Algebra, Boolean > Congresses.
Quasi-metric spaces > Congresses.
Petri nets > Congresses.
Set theory > Congresses.
Algebra, Boolean.
Logic, Symbolic and mathematical.
Logic.
Petri nets.
Philosophy.
Quasi-metric spaces.
Set theory.
Theoretical Philosophy.
Mathematik.
Logique symbolique et mathématique > Congrès.
Algèbre de Boole > Congrès.
Espaces quasi-métriques > Congrès.
Réseaux de Pétri > Congrès.
Théorie des ensembles > Congrès.
MATHEMATICS > General.
Conference papers and proceedings.
Accès en ligne:Texto completo
Table des matières:
  • 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

Documents similaires