Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Publicly Available Published by De Gruyter 2014

Contents

From the book Logic, Computation, Hierarchies

https://doi.org/10.1515/9781614518044.toc
Download chapter (PDF)
Download chapter (PDF)
From the book
Logic, Computation, Hierarchies
Logic, Computation, Hierarchies

Chapters in this book (22)

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
Downloaded on 30.11.2023 from https://www.degruyter.com/document/doi/10.1515/9781614518044.toc/html
Scroll to top button