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.
Author(s): Claudio Zandron (auth.), Margaret Archibald, Vasco Brattka, Valentin Goranko, Benedikt Löwe (eds.)
Series: Lecture Notes in Computer Science 5489 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2009
Language: English
Pages: 139
Tags: Artificial Intelligence (incl. Robotics); Theory of Computation; Algorithm Analysis and Problem Complexity; Mathematical Logic and Formal Languages; Mathematics of Computing; Computing Methodologies
Front Matter....Pages -
Nadia Busi (1968–2007)....Pages 1-1
Symbolic Model Checking of Tense Logics on Rational Kripke Models....Pages 2-20
Genetic Systems without Inhibition Rules....Pages 21-31
Probabilistic Systems with LimSup and LimInf Objectives....Pages 32-45
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata....Pages 46-55
Towards Model-Checking Programs with Lists....Pages 56-86
Representations of Numbers as $\sum_{k=-n}^n \varepsilon_k k$ :A Saddle Point Approach....Pages 87-96
Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata....Pages 97-108
Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions....Pages 109-125
Is P = PSPACE for Infinite Time Turing Machines?....Pages 126-137
Back Matter....Pages -