Heinz-Dieter Ebbinghaus

Wolfgang Thomas

Jörg Flum

Was ist ein mathematischer Beweis? Wie lassen sich Beweise rechtfertigen? Gibt es Grenzen der Beweisbarkeit? Ist die Mathematik widerspruchsfrei? Kann man das Auffinden mathematischer Beweise Computern übertragen? Erst im 20. Jahrhundert ist es der mathematischen Logik gelungen, weitreichende Antworten auf diese Fragen zu geben: Im vorliegenden Werk werden die Ergebnisse systematisch zusammengestellt; im Mittelpunkt steht dabei die Logik erster Stufe. Die Lektüre setzt – außer einer gewissen Vertrautheit mit der mathematischen Denkweise – keine spezifischen Kenntnisse voraus. In der vorliegenden 5. Auflage finden sich erstmals Lösungsskizzen zu den Aufgaben.

Einführung in die mathematische Logik

This introduction to first-order logic clearly works out the role of first-order logic in the foundations of mathematics, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. It covers several advanced topics not commonly treated in introductory texts, such as Fraïssé's characterization of elementary equivalence, Lindström's theorem on the maximality of first-order logic, and the fundamentals of logic programming.

Mathematical Logic

Sotiris Nikoletseas

Alberto Marchetti-Spaccamela

Susanne Albers

Yossi Matias

The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009. The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 5555 contains 62 contributions of track A selected from 223 submissions as well as 2 invited lectures. This two-volume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS).

36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I

Automata, Languages and Programming

ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6–10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.

36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II

Bruno Durand

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, held in February 2006. The 54 revised full papers presented together with three invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, and logic in computer science.

23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings

STACS 2006

This book constitutes the refereed proceedings of the Second International Conference on Foundations of Software Science and Computation Structures, FOSSACS '99, held in Amsterdam, The Netherlands in March 1999 as part of ETAPS'99. The 18 revised full papers presented were carefully selected from a total of 40 submissions. Also included are three invited papers. The central issues of the papers are theories and methods which suport the specification, transformation, verification and analysis of programs and software systems.

Second International Conference, FOSSACS'99, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings

Foundations of Software Science and Computation Structures

This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers were carefully reviewed and selected from about 400 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, logic in computer science, semantics, specification, and verification of programs, rewriting and deduction, as well as current challenges like biological computing, quantum computing, and mobile and net computing

24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings

STACS 2007

Erich Gradel

A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems. For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games. The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.

A Guide to Current Research

Automata, Logics, and Infinite Games

H.-D. Ebbinghaus

J. Flum

Ludger Stammermann

Werbung in Computerspielen – In-Game Advertising genannt – ist ein viel versprechender Ansatz für die gebeutelte Werbebranche. Die Autoren zeigen, wie dieses neue Werbemedium funktioniert. Sie erfahren, welche Zielgruppen bereits heute in relevanten Größenordnungen erreicht werden können, wie Sie In-Game Advertising in Ihre Mediaplanung einbeziehen und wie Sie es in den Media-Mix integrieren. Beispiele von ersten Kampagnen internationaler Markenartikler – unter anderem von H&M, Burger King und Volkswagen – illustrieren, wie diese neue Werbeform in der Praxis eingesetzt wird.

Wolfgang Thomas

About

Books

Join the club