Library Catalog
Amazon cover image
Image from Amazon.com

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

Contributor(s): Material type: TextTextSeries: Ontos Mathematical Logic ; 4Publisher: Berlin ; Boston : De Gruyter, [2014]Copyright date: ©2014Description: 1 online resource (414 p.)Content type:
Media type:
Carrier type:
ISBN:
  • 9781614517832
  • 9781614519409
  • 9781614518044
Subject(s): DDC classification:
  • 511.324 23
LOC classification:
  • QA10.3
Other classification:
  • online - DeGruyter
Online resources: Available additional physical forms:
  • Issued also in print.
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
Summary: 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 temporal logic and paraconsistent logic. This volume will be of interest to mathematicians and logicians, as well as theoretical computer scientists.
Holdings
Item type Current library Call number URL Status Notes Barcode
eBook eBook Biblioteca "Angelicum" Pont. Univ. S.Tommaso d'Aquino Nuvola online online - DeGruyter (Browse shelf(Opens below)) Online access Not for loan (Accesso limitato) Accesso per gli utenti autorizzati / Access for authorized users (dgr)9781614518044

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

restricted access online access with authorization star

http://purl.org/coar/access_right/c_16ec

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 temporal logic and paraconsistent logic. This volume will be of interest to mathematicians and logicians, as well as theoretical computer scientists.

Issued also in print.

Mode of access: Internet via World Wide Web.

In English.

Description based on online resource; title from PDF title page (publisher's Web site, viewed 28. Feb 2023)