Logic, Computation, Hierarchies /

Logic, Computation, Hierarchies / / ed. by Vasco Brattka, Hannes Diener, Dieter Spreen.

Show other versions (1)

Published in honor of Victor L. Selivanov, the 17 articles collected in this volume inform on the latest developments in computability theory and its applications in computable analysis; descriptive set theory and topology; and the theory of omega-languages; as well as non-classical logics, such as...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1
MitwirkendeR:
Agyingi, Collins Amburo,
Ambos-Spies, Klaus,
Duparc, Jacques,
Finkel, Olivier,
Fouché, Willem L.,
Haihambo, Paulus,
Hertling, Peter,
Konovalov, Anton,
Kopczynski, Eryk,
Künzi, Hans-Peter A.,
Motto Ros, >Luca,
Niwinski, Damian,
Odintsov, Sergey,
Ressayre, Jean-Pierre,
Schlicht, Philipp,
Selivanov, Victor,
Selivanova, Svetlana,
Shilov, Nikolay V.,
Spreen, Dieter,
Staiger, Ludwig,
Sy-David, >Friedman,
Zhukov, Anton V.,
de Brecht, Matthew,
HerausgeberIn:
Brattka, Vasco,
Diener, Hannes,
Spreen, Dieter,
Place / Publishing House:Berlin ;, Boston : : De Gruyter, , [2014]
©2014
Year of Publication:2014
Language:English
Series:Ontos Mathematical Logic , 4
Online Access:
Physical Description:1 online resource (414 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • Frontmatter
  • 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 spaces
  • ON 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

Similar Items