Margaret Archibald; Vasco Brattka; Valentin F. Goranko; Benedikt Löwe Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2009) Saatavuus: Tilaustuote Pehmeäkantinen kirja
H. Boegehold; O. Eppenstein; H. Hartinger; F. Jentzsch; H. Kessler; F. Löwe; W. Merté; M. von Rohr; H. Konen; H Geiger Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (1927) Saatavuus: Tilaustuote Pehmeäkantinen kirja
A. Bömer; Fr. Goppelsroeder; J. Hasenbäumer; F. Löwe; A. Scholl; A. Spieckermann; A. Thiel; P. Waentig; J. König Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (1910) Saatavuus: Tilaustuote Pehmeäkantinen kirja
A. Bömer; P. W. Danckwortt; H. Freund; R. Grau; C. Griebel; P. Hirsch; H. Ley; O. Liesche; F. Löwe; R. Strohecker; Täu Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (1933) Saatavuus: Tilaustuote Pehmeäkantinen kirja
K.R. Andreß; A.A. Benedeti-Pichler; R. Berg; M. Haitinger; G. Hesse; J. Heyrovský; H. Lieb; F. Löwe; H. Mann; Meidinger Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (1939) Saatavuus: Tilaustuote Pehmeäkantinen kirja
By Enos L. Stover; Peter J. Marks; United States. Environmental Protection Agency. Office of Research and Development; Roy F. We Kniga po trebovaniyu Saatavuus: Tilaustuote
Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this volume constitutes a selection of papers presented at the Internatonal Conference on Infinity in Logic and Computation, ILC 2007, held in Cape Town, South Africa, in November 2007.
The 7 revised papers presented together with 2 invited talks were carefully selected from 27 initial submissions during two rounds of reviewing and improvement. The papers address all aspects of infinity in automata theory, logic, computability and verification and focus on topics such as automata on infinite objects; combinatorics, cryptography and complexity; computability and complexity on the real numbers; infinite games and their connections to logic; logic, computability, and complexity in finitely presentable infinite structures; randomness and computability; transfinite computation; and verification of infinite state systems.
