Herman Geuvers – författare

The Annual European Meeting of the Association for Symbolic Logic, also known as the Logic Colloquium, is among the most prestigious annual meetings in the field. The current volume, with contributions from plenary speakers and selected special session speakers, contains both expository and research papers by some of the best logicians in the world. The most topical areas of current research are covered: valued fields, Hrushovski constructions (from model theory), algorithmic randomness, relative computability (from computability theory), strong forcing axioms and cardinal arithmetic, large cardinals and determinacy (from set theory), as well as foundational topics such as algebraic set theory, reverse mathematics, and unprovability. This volume will be invaluable for experts as well as those interested in an overview of central contemporary themes in mathematical logic.

Type theory is a fast-evolving field at the crossroads of logic, computer science and mathematics. This gentle step-by-step introduction is ideal for graduate students and researchers who need to understand the ins and outs of the mathematical machinery, the role of logical rules therein, the essential contribution of definitions and the decisive nature of well-structured proofs. The authors begin with untyped lambda calculus and proceed to several fundamental type systems, including the well-known and powerful Calculus of Constructions. The book also covers the essence of proof checking and proof development, and the use of dependent type theory to formalise mathematics. The only prerequisite is a basic knowledge of undergraduate mathematics. Carefully chosen examples illustrate the theory throughout. Each chapter ends with a summary of the content, some historical context, suggestions for further reading and a selection of exercises to help readers familiarise themselves with the material.

This book constitutes the refereed proceedings of the 10th International Conference on Intelligent Computer Mathematics, CICM 2017, held in Edinburgh, Scotland, in July 2017. The papers are organized in three tracks: the Calculemus track examining the integration of symbolic computation and mechanized reasoning;

This book constitutes the thoroughly refereed post-proceedings of the Second International Workshop of the TYPES Working Group, TYPES 2002, held in Berg en Dal, The Netherlands in April 2002. The 18 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in type theory and type systems and their applications to programming, systems design, and proof theory are addressed. Among the systems dealt with are Coq and Isar/HOL.