The beta version of DROPS 2 is now publicly available! Check this page out at DROPS 2 now!


License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.3.7.54
URN: urn:nbn:de:0030-drops-43068
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4306/
Go back to Dagstuhl Reports

Gehrke, Mai ; Pin, Jean-Eric ; Selivanov, Victor ; Spreen, Dieter
Weitere Beteiligte (Hrsg. etc.): Mai Gehrke and Jean-Eric Pin and Victor Selivanov and Dieter Spreen

Duality in Computer Science (Dagstuhl Seminar 13311)

pdf-format:
dagrep_v003_i007_p054_s13311.pdf (0.8 MB)

Abstract

Duality allows one to move between the two worlds: the world of certain algebras of properties and a spacial world of individuals, thereby leading to a change of perspective that may, and often does, lead to new insights. Dualities have given rise to active research in a number of areas of theoretical computer science.
Dagstuhl Seminar 13311 "Duality in Computer Science" was held to stimulate research in this area. This report collects the ideas that were presented and discussed during the course of the seminar.

BibTeX - Entry

@Article{gehrke_et_al:DR:2013:4306,
  author =	{Mai Gehrke and Jean-Eric Pin and Victor Selivanov and Dieter Spreen},
  title =	{{Duality in Computer Science (Dagstuhl Seminar 13311)}},
  pages =	{54--73},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{7},
  editor =	{Mai Gehrke and Jean-Eric Pin and Victor Selivanov and Dieter Spreen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4306},
  URN =		{urn:nbn:de:0030-drops-43068},
  doi =		{10.4230/DagRep.3.7.54},
  annote =	{Keywords: Stone-Priestley duality, Point free topology, Infinite computations Exact real number computation, Computability in analysis, Hierarchies, Reducibilit}
}

Keywords: Stone-Priestley duality, Point free topology, Infinite computations Exact real number computation, Computability in analysis, Hierarchies, Reducibilit
Freie Schlagwörter (englisch): Topological complexity, Domain theory, Semantics, Recognizability, Profinite topology
Collection: Dagstuhl Reports, Volume 3, Issue 7
Issue Date: 2013
Date of publication: 15.11.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI