Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field.
Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski).

Over the last few decades the interest of logicians and mathematicians in constructive and computational aspects of their subjects has been steadily growing, and researchers from disparate areas realized that they can benefit enormously from the mutual exchange of techniques concerned with those aspects. A key figure in this exciting development is the logician and mathematician Helmut Schwichtenberg to whom this volume is dedicated on the occasion of his 70th birthday and his turning emeritus. The volume contains 20 articles from leading experts about recent developments in Constructive set theory, Provably recursive functions, Program extraction, Theories of truth, Constructive mathematics, Classical vs. intuitionistic logic, Inductive definitions, and Continuous functionals and domains.

At first glance, Robinson's original form of nonstandard analysis appears nonconstructive in essence, because it makes a rather unrestricted use of classical logic and set theory and, in particular, of the axiom of choice. Recent developments, however, have given rise to the hope that the distance between constructive and nonstandard mathematics is actually much smaller than it appears. So the time was ripe for the first meeting dedicated simultaneously to both ways of doing mathematics and to the current and future reunion of these seeming opposites.

Consisting of peer-reviewed research and survey articles written on the occasion of such an event, this volume offers views of the continuum from various standpoints. Including historical and philosophical issues, the topics of the contributions range from the foundations, the practice, and the applications of constructive and nonstandard mathematics, to the interplay of these areas and the development of a unified theory. This book will be of interest to mathematicians, logicians, and philosophers, as well as theoretical computer scientists, physicists, and economists who are interested in theories of the continuum and in constructive or nonstandard mathematics. The major part is accessible for the non-expert professional reader, from graduate student to academic level. "

This book constitutes the refereed proceedings of the Second International Conference on Computability in Europe, CiE 2006, held in Swansea, UK, June/July 2006. The book presents 31 revised full papers together with 30 invited papers, including papers corresponding to 8 plenary talks and 6 special sessions on proofs and computation, computable analysis, challenges in complexity, foundations of programming, mathematical models of computers and hypercomputers, and G del centenary: G del's legacy for computability.

At first glance, Robinson's original form of nonstandard analysis appears nonconstructive in essence, because it makes a rather unrestricted use of classical logic and set theory and, in particular, of the axiom of choice. Recent developments, however, have given rise to the hope that the distance between constructive and nonstandard mathematics is actually much smaller than it appears. So the time was ripe for the first meeting dedicated simultaneously to both ways of doing mathematics and to the current and future reunion of these seeming opposites.

Consisting of peer-reviewed research and survey articles written on the occasion of such an event, this volume offers views of the continuum from various standpoints. Including historical and philosophical issues, the topics of the contributions range from the foundations, the practice, and the applications of constructive and nonstandard mathematics, to the interplay of these areas and the development of a unified theory.

Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field.
Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski).

This book constitutes the proceedings of the 18th Conference on Computability in Europe, CiE 2022, in Swansea, UK, in July 2022. The 19 full papers together with 7 invited papers presented in this volume were carefully reviewed and selected from 41 submissions. The motto of CiE 2022 was "Revolutions and revelations in computability". This alludes to the revolutionary developments we have seen in computability theory, starting with Turing's and Goedel's discoveries of the uncomputable and the unprovable and continuing to the present day with the advent of new computational paradigms such as quantum computing and bio-computing, which have dramatically changed our view of computability and revealed new insights into the multifarious nature of computation.

Analyse zum Jahrhundertprojekt Single Euro Payment Area-Projekt (SEPA) - der europaweiten Vereinheitlichung des Massenzahlungsverkehrs. Trotz seiner Tragweite besteht ein gravierendes Informationsdefizit im offentlichen Diskurs. Dieses Buch bietet eine kritische Analyse von SEPA aus wissenschaftlicher Perspektive. Zahlungskartensysteme, die wichtigsten (inter)nationalen Regulierungsinitiativen, Handlungsalternativen fur die Wirtschaftspolitik."