Author: Peter Cholak
Publisher: A K Peters/CRC Press
Release Date: 2005-04-09
In fall 2000, the Notre Dame logic community hosted Greg Hjorth, Rodney G. Downey, Zoé Chatzidakis, and Paola D'Aquino as visiting lecturers. Each of them presented a month long series of expository lectures at the graduate level. The articles in this volume are refinements of these excellent lectures.
Author: Barry S. Cooper
Release Date: 2007-07-25
This book constitutes the refereed proceedings of the Third International Conference on Computability in Europe, CiE 2007, held in Sienna, Italy, in June 2007. The 50 revised full papers presented together with 36 invited papers were carefully reviewed and selected from 167 submissions.
Presents Results from a Very Active Area of Research Exploring an active area of mathematics that studies the complexity of equivalence relations and classification problems, Invariant Descriptive Set Theory presents an introduction to the basic concepts, methods, and results of this theory. It brings together techniques from various areas of mathematics, such as algebra, topology, and logic, which have diverse applications to other fields. After reviewing classical and effective descriptive set theory, the text studies Polish groups and their actions. It then covers Borel reducibility results on Borel, orbit, and general definable equivalence relations. The author also provides proofs for numerous fundamental results, such as the Glimm–Effros dichotomy, the Burgess trichotomy theorem, and the Hjorth turbulence theorem. The next part describes connections with the countable model theory of infinitary logic, along with Scott analysis and the isomorphism relation on natural classes of countable models, such as graphs, trees, and groups. The book concludes with applications to classification problems and many benchmark equivalence relations. By illustrating the relevance of invariant descriptive set theory to other fields of mathematics, this self-contained book encourages readers to further explore this very active area of research.
Author: Rodney G. Downey
Publisher: Springer Science & Business Media
Release Date: 2010-10-29
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields.
Author: Marta Sanz Solé
Publisher: Amer Mathematical Society
Release Date: 2006-12
The International Congress of Mathematicians (ICM) is held every four years. It is a major scientific event, bringing together mathematicians from all over the world and demonstrating the vital role that mathematics play in our society. In particular, the Fields Medals are awarded to recognize outstanding mathematical achievement. At the same time, the International Mathematical Union awards the Nevanlinna Prize for work in the field of theoretical computer science. The proceedings of ICM 2006, published as a three-volume set, present an overview of current research in all areas of mathematics and provide a permanent record the congress. The first volume features the works of Fields Medallists and the Nevanlinna Prize winner, the plenary lectures, and the speeches and pictures of the opening and closing ceremonies and award sessions. The other two volumes present the invited lectures, arranged according to their mathematical subject. Information for our distributors: Distributed within the Americas by the American Mathematical Society. All commerical channel discounts apply.
Author: Karl Meinke
Publisher: John Wiley & Sons
Release Date: 1993-03-09
Prominent experts present papers which discuss problems regarding this subject. Coverage includes case studies in the translation of logics for second-order and propositional dynamic logic; many-sorted algebras and equational logic; logical foundations of artificial intelligence along with a variety of methods that exist to encode information; program verification techniques such as Floyd-Hoare, intermittent assertion and temporal logic of programs.